So, in particular, the goal of this lecture will be to mathematically argue the following claim from an earlier [inaudible], that, in order to sort an array in numbers, the merge sort algorithm needs no more than a constant times N log 