quick sort

Algorithm Complexity Implementations Optimizations Applications Discussions Quicksort algorithm is a comparison sort algorithm based on Divide and Conquer strategy. It has an average performance of Θ(n*log(n)) and is considered as