Divide and conquer

Revision en1, by gXa, 2016-01-16 13:15:40

Can somebody help me in finding running time of algo: Partitions the problem into two sub-problems of sizes n/5 and 7n/10, and spends O(n/log n) time to divide and combine the solutions.

Tags running time

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English gXa 2016-01-16 13:15:40 205 Initial revision (published)