medium10 pts · first answer countssorting-and-searching
Why quick sort uses a random pivot
An API sorts user lists with a quick sort that always picks the first element as the pivot. Requests with already sorted lists are very slow. What is the standard fix?
Discussion 0
Join free to post in the discussion.
Related questions
- Bubble sort best case with early exitBackend Developer
- What a stable sort meansBackend Developer
- Merge sort time in every caseBackend Developer
- Best simple sort for nearly sorted dataBackend Developer
- Swaps made by selection sortBackend Developer
- What in-place sorting meansBackend Developer
- Quick sort worst-case timeBackend Developer
- JavaScript default sort on numbersBackend Developer