next up previous
Next: Example: Merge Sort Up: l1 Previous: Designing Algorithms

Example: Merge Sort



  1. DIVIDE the n element sequence to be sorted into two subsequences of n/2 elements each.
  2. CONQUER (sort) the two subsequences recursively using merge sort
  3. COMBINE (merge) the two sorted subsequences to produce the sorted answer


next up previous
Next: Example: Merge Sort Up: l1 Previous: Designing Algorithms