<s>[INST] How to estimate the asymptotic complexity of divide and conquer algorithms? [/INST] With reasonable divides you will get a complexity of O(nLogn). And actually this is both the average and the best case complexity.</s>\ <s>[INST] please give me an example [/INST] 