next up previous
Next: Example: Merge Sort Up: CSE 2320: Algorithms and Previous: Designing Algorithms

Example: Merge Sort



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



Copyright © 1998 The University of Texas at Arlington