The page shows an animation about the quick sort algorithm. You can click on the button Animation to play the process. QuickSort uses a divide and conquer strategy to divide a list into two sub-lists. It is another typical application of divide-and-conquer in sorting algorithms. Ordering n items needs (nlogn) … Continue reading Quick Sort Animation