Theoretical Time Complexity Problem

Revision en1, by kaldiuo, 2017-12-14 17:34:44

Suppose that we have a divide and conquer algorithm f(n) such that O(f(n))=O(min(a, b)+f(a)+f(b)) where a+b=n, then what is the worst time complexity of f(n) (explicitly)?


  Rev. Lang. By When Δ Comment
en1 English kaldiuo 2017-12-14 17:34:44 206 Initial revision (published)