For many problems, there are different ways you could divide the problem into pieces in a divide$-$and$-$conquer solution. Often finding the right way to divide the problem is half the solution. Sometimes more effort goes into the conquer $($recombine$)$ step and sometimes more effort goes into the divide step.

Which of the two recursive sorting algorithms we studied, Merge sort and Quicksort, put more effort into the "divide" step?