Divide and Conquer ( O (n logn ) ) comparision against the brute force O ( n ^ 2) approach.