IQAC Image
IQAC Image
DIU Logo
QS Ranking

DIU JOURNAL OF SCIENCE AND TECHNOLOGY

Our Feauture
  • Free of Cost Publishing
  • Global Exposer
  • Rigorous Peer Review
  • Prompt Publishing
  • Open Access

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

Authors

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

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.

Keywords

Merge sort, merging, recursion, base case, running time, divide & conquer.

Manuscript Submission
Click Here to Submit Manuscript