Page 129 - Data Structures Interactive Book

10.3.2 Quick Sort (Partitioning Method)

Quick Sort also uses divide and conquers but works differently. It selects a pivot

element and partitions the array so that elements smaller than the pivot are placed on the

left and larger ones on the right. The process is repeated recursively. Quick Sort is very

efficient in practice, with average-case complexity ( log⁡ ), but worst-case ( )⁡if pivots

are chosen poorly.

129