Merge Sort Algorithm
Abstract
In this paper, we introduce Merge Sort, a divide-and overcome algorithm to sort an N element array. We evaluate the O NlogN time complexity of merge sort theoretically and empirically. Our results show a large improvement in efficiency over other algorithms.
Keywords
Merge Sort Algorithm; improvement in efficiency
Full Text:
PDFCopyright (c) 2014 Akash Kumar, Akshay Dutt, Gautam Saini
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
All published Articles are Open Access at https://journals.pen2print.org/index.php/ijr/
Paper submission: ijr@pen2print.org