Skip to main content
Lesson 25 - Merge and Mergesort
Lesson MenuNext
  
Introduction page 1 of 9

In Lesson 23, we studied the quadratic sorting algorithms. We saw how the number of steps required increased as an N2 factor when sorting N elements. In the next two lessons we will study two recursive sorts, mergesort and quicksort, which work by dividing lists in half. In this lesson, after solving a preliminary merge problem, you will code a recursive mergesort.

The key topics for this lesson are:


Lesson MenuNext
Contact
 ©ICT 2003, All Rights Reserved.