ADVANCEMENT OF BASE CASE TO THE RECURSION: A   WAY TO IMPROVE THE RUNNING TIME OF THE      TRADITIONAL MERGE SORT ALGORITHM

Talukder, Ashis; Mamun, Shamim Al; Alam, Abu Md. Zafor

dc.contributor.author	Talukder, Ashis
dc.contributor.author	Mamun, Shamim Al
dc.contributor.author	Alam, Abu Md. Zafor
dc.date.accessioned	2012-11-08T05:57:33Z
dc.date.accessioned	2019-05-28T09:37:04Z
dc.date.available	2012-11-08T05:57:33Z
dc.date.available	2019-05-28T09:37:04Z
dc.date.issued	2007-07-01
dc.identifier.uri	http://hdl.handle.net/20.500.11948/455
dc.description.abstract	Merge sort is one of the best examples of divide and conquer technique. Divide and conquer is inherently recursive by nature. So if the number of recursive calls can be decreased, the complexity of any recursive algorithm can be improved. This naturally leads to the advancement of base case of recursion. In this research paper, we propose such a base case-advancement technique. We will apply it upon the traditional merge sort and show that it improves the number of recursive calls, the running time as well as the memory requirement.	en_US
dc.language.iso	en	en_US
dc.publisher	Daffodil International University	en_US
dc.subject	Merge sort, merging, recursion, base case, running time, divide & conquer.	en_US
dc.title	ADVANCEMENT OF BASE CASE TO THE RECURSION: A WAY TO IMPROVE THE RUNNING TIME OF THE TRADITIONAL MERGE SORT ALGORITHM	en_US
dc.type	Article	en_US