Talk:Sorting algorithms/Merge sort

Revision as of 14:20, 24 July 2010 by rosettacode>Starfiend (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…')

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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)

Retrieved from "https://rosettacode.org/wiki/Talk:Sorting_algorithms/Merge_sort?oldid=153464"

Return to "Sorting algorithms/Merge sort" page.