Quicksort is faster than most other comparison-based sorting algorithms, such as bubble sort, insertion sort, and selection sort, which have a worst case running time of O (n^2).