Merge Sort Algorithm

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 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