Tagged: mergesort

Merge Sort: Implementation and Analysis

Merge Sort Merge sort is a divide and conquer algorithm that sorts objects in O(n log n) time. Merge sort begins by dividing the input list into two sublists, and then continues to divide each subsequent sublist until we are left with a bunch of sublists that each contain one element. Each one element list is considered sorted. Next, Merge sort conquers each sorted sublist by repeatedly merging adjacent sorted...


Get every new post on this blog delivered to your Inbox.

Join other followers: