as the time complexity of quick sort with randomisation comes out to be O(nlogn), while the compexity of merge sort is always O(nlogn) in all cases. then why dont we use merge sort in standard sort() function??
Sorting techniques
Hello @aman17nov1999,
You can refer to the following post which describes it in detail:
Hope, this would help.
Give a like if you are satisfied.
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.