A BOTTOM-UP MERGESORT ELIMINATING RECURSION
Oksam Chae, Mohammad Abdullah-Al-Wadud, Md Amiruzzaman · 2008
In this paper an improved mergesort technique is proposed by us. The recursive calls are removed by using a bottom-up strategy to select two lists to merge. Some earlier improve- ments on the merge procedure, which are done by different researchers, into an efficient merge pro- cedure that requires less space for auxiliary memory and less number of conditions checking also combined. Keyword: Mergesort, recursive calls, aux- iliary array, bottom-up.