International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
This paper discusses about different between the run time complexities of Recursive and non-recursive merge sort algorithm. The efficiency of merge sort programs is analyzed under a simple unit-cost model. In the authors' analysis the time performance of the sorting programs includes the costs of key comparisons, element moves and address calculations. The goal is to establish the best possible time-bound relative to the model when sorting n integers. By the well-known information-theoretic argument n log n - O (n) is a lower bound for the integer-sorting problem in their framework.