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.

Sponsored Links


CS502 Fundamentals of Algorithms GDB no 1 Due date 3rd February 2016