Discrete Mathematics - MGNet

Merge sort is a balanced binary tree method that first breaks a list up recursively into two lists until each sublist has only one element. Then the sublists are recombined, two at a time and sorted order, until only one sorted list remains. Note: The height of the tree formed in merge sort is O(log2n) for n elements. ................
................