title: Time complexity in Divide and conquer algorithms
body: <p>Could you please help me in understanding the Time Complexity for Divide and Conquer algorithm.</p>
  
  <p>Let's take example of this one.
  <a href="http://www.geeksforgeeks.org/archives/4583" rel="nofollow">http://www.geeksforgeeks.org/archives/4583</a> Method 2:
  It gave T(n) = 3/2n -2  and i don't understand why?</p>
  
  <p>I am sorry, if i gave you an extra page to open too but i really wanna understand atleast to a good high level so that i can find the complexity of such algorithms on my own, You answer is highly appreciated.</p>