A BOTTOM-UP MERGESORT ELIMINATING RECURSION

Wadud, M. Abdullah-Al; Amiruzzaman, Md; Chae, Oksam

dc.contributor.author	Wadud, M. Abdullah-Al
dc.contributor.author	Amiruzzaman, Md
dc.contributor.author	Chae, Oksam
dc.date.accessioned	2012-11-08T06:50:32Z
dc.date.accessioned	2019-05-28T09:39:21Z
dc.date.available	2012-11-08T06:50:32Z
dc.date.available	2019-05-28T09:39:21Z
dc.date.issued	2008-01-01
dc.identifier.uri	http://hdl.handle.net/20.500.11948/464
dc.description.abstract	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.	en_US
dc.language.iso	en	en_US
dc.publisher	Daffodil International University	en_US
dc.subject	Mergesort, recursive calls, auxiliary array, bottom-up.	en_US
dc.title	A BOTTOM-UP MERGESORT ELIMINATING RECURSION	en_US
dc.type	Article	en_US