The recursive mergeSort produces a dramatic increase in efficiency in comparison with the N² order of the quadratic sorts. This concept of dividing the problem in two is used in several other classic algorithms. Once again, recursion makes it easier to define a problem and code the solution.