Next:
Example: Merge Sort
Up:
l1
Previous:
Designing Algorithms
Example: Merge Sort
DIVIDE the n element sequence to be sorted into two subsequences of n/2 elements each.
CONQUER (sort) the two subsequences recursively using merge sort
COMBINE (merge) the two sorted subsequences to produce the sorted answer
Next:
Example: Merge Sort
Up:
l1
Previous:
Designing Algorithms