Quicksort is a stable sorting algorithm.

Quicksort performs better than merge sort in all cases.

Quicksort always uses the last element of the array as the pivot.

Quicksort has a worst-case time complexity of O( n log⁡n ).

The efficiency of quicksort depends heavily on the choice of the pivot.