Is your feature request related to a problem? Please describe.Quick Sort algorithm is a basic fast-searching algorithm with a time complexity of O(nlogn)
Describe the solution you'd likeQuick Sort is a well known algorithm used to sort an array with a NlogN time complexity. However in the worst case scenario it takes a time complexity of O(n^2) to sort an array of length N(i.e when already sorting in asc. or desc. order). Therefore the it can be combined with the median of medians algorithm(i.e to choose the best pivot) to ensure the time complexity to be O(nlogn).
Is your feature request related to a problem? Please describe.
Quick Sort
algorithm is a basic fast-searching algorithm with a time complexity ofO(nlogn)
Describe the solution you'd like
Quick Sort
is a well known algorithm used to sort an array with a NlogN time complexity. However in the worst case scenario it takes a time complexity of O(n^2) to sort an array of length N(i.e when already sorting in asc. or desc. order). Therefore the it can be combined withthe median of medians
algorithm(i.e to choose the best pivot) to ensure the time complexity to be O(nlogn).