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

Simple item page
dc.contributor.authorTalukder, Ashis
dc.contributor.authorMamun, Shamim Al
dc.contributor.authorAlam, Abu Md. Zafor
dc.date.accessioned2012-11-08T05:57:33Z
dc.date.accessioned2019-05-28T09:37:04Z
dc.date.available2012-11-08T05:57:33Z
dc.date.available2019-05-28T09:37:04Z
dc.date.issued2007-07-01
dc.description.abstractMerge 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.
dc.identifier.otherhttp://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/455
dc.identifier.urihttp://hdl.handle.net/20.500.11948/455
dc.language.isoen
dc.publisherDaffodil International University
dc.sourceDIU Institutional Repository
dc.subjectMerge sort, merging, recursion, base case, running time, divide & conquer.
dc.titleADVANCEMENT OF BASE CASE TO THE RECURSION: A WAY TO IMPROVE THE RUNNING TIME OF THE TRADITIONAL MERGE SORT ALGORITHM
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Advancement of base.pdf.txt
Size:
15.74 KB
Format:
Adobe Portable Document Format
Download

Collections

Vol. 02, Issue 2, July 2007