Sorting complexity: beat O(n²), then design the worst correct sort

0
Remix

A verbal round with no coding, asked as a quick series:

  1. Explain a sorting algorithm faster than O(n²) and why it is faster; be ready for quicksort's worst case.
  2. Name or invent the worst sorting algorithm you can that is still correct (always terminates, returns the input in order) and give its running time.
  3. If your slow sort tries orderings, how would you generate every permutation of the input?
MercorTechnical phone screenLast asked Oct 2026
No answer yet. Write the first one; the best answer gets endorsed.