Which sorting algorithm has worst-case time comple...
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 has worst-case time complexity of O(n²) ?

Asked in TPSC Senior Technical Assistant 2026

  1. Merge Sort
  2. Quick Sort
  3. Heap Sort
  4. Counting 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 →