I've been having a little trouble figuring out how to calculate the time complexity for merge-sorting this series of numbers: 44, 112, 178, 48, 10, 22, 28, 186, 66, 86, 128, 82, 168. The numbers should end up in ascending order.
I'm not sure if this will help or not, but here's a diagram showing the merge-sorting function being run on a different set of numbers: http://upload.wikimedia.org/wikipedia/commons/thumb/e/e6/Merge_sort_algorithm_diagram.svg/300px-Merge_sort_algorithm_diagram.svg.png
