Despite the name, the quick sort algorithm has a worst-case complexity of O(n²). You might or might not want to try merge sort instead, depending on the size (and sorting state) of your list.
Add it!
Or you could select a random element to be the pivot, that way you reduce a lot the chances of waving the worst case
Thanks for reminding me! I just forgot to add it.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Despite the name, the quick sort algorithm has a worst-case complexity of O(n²). You might or might not want to try merge sort instead, depending on the size (and sorting state) of your list.
Add it!
Or you could select a random element to be the pivot, that way you reduce a lot the chances of waving the worst case
Thanks for reminding me! I just forgot to add it.