(8) Divide and conquer is faster? (proof by example needed) - Quora

(8) Divide and conquer is faster? (proof by example needed) - Quora

Quicksort. In this case the method divides the problem into two smaller ones, and so forth. When the data are randomly distributed, the problem is divided into two similarly sized chunks. In this case, the division is approximately half the size of the whole chunk and the algorithm exploits locality adequately. When data are pre-sorted, the chunks are not of equal size and the algorithm does not exploit locality at all.

Read full article from (8) Divide and conquer is faster? (proof by example needed) - Quora