Merge Sort Algorithm

Jaiveer Singh, Raju Singh

Abstract


Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion and Selection Sort all have a quadratic time complexity that limits their use when the number of elements is very big. In this paper, we introduce Merge Sort, a divide-and- conquer algorithm to sort an N element array.

Keywords


Algorithm; Merge Sort; N Element Array

Full Text:

PDF


Bookmark and Share


Copyright (c) 2014 Jaiveer Singh, Raju Singh

Creative Commons License
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