4.3.5.2 Merge sort

 To meet this assessment objective you should be able to:

Be able to trace and analyse the time complexity of the merge sort algorithm.

The 'merge' sort is an example of 'Divide and Conquer' approach to problem solving. Time complexity is O(nlog n).