Optimize worst case complexity of quick sort

#1

using randomized quicksort, the worst case complexity is not improved… right?
so how to do so
…

#2

@deck123 we cannot improve further but it will work in nlogn time in most of the cases.
but in competitions you use inbuilt sort which is nlogn in worst so no issues

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.