Divide and conquer

Правка en1, от 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.

Теги running time

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский gXa 2016-01-16 13:15:40 205 Initial revision (published)