|
- Another very interesting sorting algorithm is Quick sort. Its worst time complexity is O(
 ), but it is a faster then many optimal algorithms for many input instances.
- It is an another divide and conquer algorithm.
- Main idea of the algorithm is to partition the given elements into two sets such that the smaller numbers into one set and larger number into another. This partition is done with respective an element called pivot. Repeat the process for both the sets until each partition contains only one element.
|
|
