![]() All subproblems are assumed to have the same size.į(n) = cost of the work done outside the recursive call, which includes the cost of dividing the problem and cost of merging the solutions The complexity of the divide and conquer algorithm is calculated using the master theorem.Ī = number of subproblems in the recursion Here, conquer and combine steps go side by side.
0 Comments
Leave a Reply. |