How to estimate the asymptotic complexity of divide and conquer algorithms?