Talk:Sorting algorithms/Merge sort: Difference between revisions
Content added Content deleted
(Created page with '== Merge Sort can be an iterative sort == The merge sort is NOT a recursive sort through necessity (unlike the quick sort) but through implementation. An alternative algorithm f…') |
(No difference)
|
Revision as of 14:20, 24 July 2010
Merge Sort can be an iterative sort
The merge sort is NOT a recursive sort through necessity (unlike the quick sort) but through implementation. An alternative algorithm for the merge sort looks like this:
n=1 Repeat Merge lists of size n Double n Until n >= Size
This is a purely iterative process. Starfiend 14:20, 24 July 2010 (UTC)