The merge sort algorithm can be described
recursively in terms of two similar problems that each work on half of the
cards.
To Merge Sort n Cards:
- If n=1, the cards are in order, so quit
- Otherwise:
- Merge Sort the First n/2 Cards,
- Merge Sort the Other n/2 Cards,
- Merge together the two sorted halves.