PYQPulse
HomeMocksPracticePYQsUpdatesDashboard
PYQPulse

Timing-accurate mock tests and PYQs for SSC, Banking and Railway exams — so the real paper feels like a revision.

Exams

  • SSC exams
  • Banking exams
  • Railway exams
  • All exams

Practice

  • Practice questions
  • Mock test series
  • Sectional tests
  • Year-wise PYQs
  • Performance analytics

Company

  • About us
  • Help Centre
  • Pricing
  • Sign in

Legal

  • Privacy Policy
  • Terms of Service

Contact

  • hello@testwala.co.in
  • Telegram
  • +91 62816 87760

Practice interface modeled on the official exam pattern — not the official examination. PYQPulse is not affiliated with the Staff Selection Commission, IBPS, SBI, RBI, NABARD, SEBI or Indian Railways.

© 2026 PYQPulse. All rights reserved.

Built for aspirants, by aspirants.

HomeMocksPracticeStats
  1. Home
  2. ›
  3. PYQs
  4. ›
  5. RRB Junior Engineer / DMS / CMA
  6. ›
  7. 2019
  8. ›
  9. Q3620

RRB Junior Engineer / DMS / CMA 2019 · Question 3620 of 3719

What is the best case time complexity of radix sort algorithm?

  1. AΩ(n log(n))
  2. BΩ(n + k)
  3. CΩ(n)
  4. DΩ(nk)Correct

Answer: D. Ω(nk)

Explanation

Concept The radix sorting algorithm is an integer sorting algorithm, that sorts by grouping numbers by their individual digits (or by their radix). It uses each radix/digit as a key, and implements counting sort or bucket sort under the hood in order to do the work of sorting Worst case time O ( n ) Best case time O ( n ) Average case time O ( n ) Space O(n) Hence Option 4 is correct

Source: RRB JE 2019 (CBT 2) (IT) Previous Year Paper (30 Aug 2019) — prepp.in solved-paper PDF (answer key with explanations) · reliable-secondary

← Q3619View full paper (3719 questions)Q3621 →

Practice the full RRB Junior Engineer / DMS / CMA 2019 paper

Timed test with all 3719 questions, just like the real exam.

Start test