title: Algorithm for finding the Maximal using Divide and conquer method
body: <p>Maxima finding problem: In the 2-dimension space, we shall say that a point A=(a1,a2) dominates a point B=(b1,b2) if and only if a1>b1 and a2>b2. Apoint is called a maximal if no other point dominates it. Design an algorithm to find all of the maximal points among the given n points. 
  <strong>(Use divide and conquer method to get O(nlogn) complexity )</strong>
  For example, the circled points in the attached image are maximal points<a href="https://i.stack.imgur.com/FNjUl.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/FNjUl.png" alt="Qn"></a></p>