Which sorting algorithm achieves O(n) time complex...
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state
TPSC Prelims previous year questions

Which sorting algorithm achieves O(n) time complexity in the best case and is stable ?

Asked in TPSC Junior System Engineer 2026

  1. Quick Sort
  2. Merge Sort
  3. Insertion Sort
  4. Heap Sort

Answer under review: our editors are checking this question. Try the other TPSC Prelims previous year questions questions meanwhile.

More TPSC Prelims previous year questions questions

All 772 TPSC Prelims previous year questions questions →