Skip to main content
Lesson 26 - Quicksort
ZIPPDF (letter)
Lesson MenuNext
  
Introduction page 1 of 6

Quicksort is another recursive sorting algorithm that works by dividing lists in half. Whereas mergesort divided lists in half and then sorts each sublist, quicksort will roughly sort the entire list, and then split the list in half. The order of these two sorts falls into the category O(N * log N), which was introduced in Lesson 25. When the lists become large, either of these sorts will do an excellent job.

The key topics for this lesson are:


Lesson MenuNext
Contact
 ©ICT 2003, All Rights Reserved.