Quick sort is one of the most fastest sorting algorithms.
This is mainly due to 2 reasons:
1. It's average time complexity is O(n log n).
2. it’s an in-place sorting algorithm.
On nearly sorted data (it's adaptive case) it is O(N). However, it takes 2 passes through the data and Insertion only takes 1 fo... Read More