252 views
0 votes
0 votes
The runtime of a divide-and-conquer algorithm is described by the following recurrence: T(n) = 4T(n/2) + O(1). How many subproblems will we have at the 6th level of recursion if the top level is considered to be the 0th level________?

what does mean by branching factor in this????

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
4
NongArundas asked Jan 7, 2019
229 views
In matrix multiplication 8T(n/2) + bn², what is the value of b?