Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
The standard worst case complexity of quick sort is O(n^2). What is this worst case and how can I make modifications in such a case to come up with a better behaviour?
This is just a theoretical question.
The worst case is whenever you choose a pivot, it always turns out to be either the largest or the smallest element in the segment that you’re sorting. To improve on the worst case, you need to have a good method of choosing the pivot.