A BOTTOM-UP MERGESORT ELIMINATING RECURSION
Wadud, M. Abdullah-Al
MetadataShow full item record
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 improvements on the merge procedure, which are done by different researchers, into an efficient merge procedure that requires less space for auxiliary memory and less number of conditions checking also combined.