The Gateway to Computer Science Excellence
0 votes
33 views
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????
in Algorithms by (445 points) | 33 views
0
0

Every function is going call 4T(n/2) i.e.

level 1: 4 

level 2: 4*4=> 4^2

similarly level 6=> 4^6

The branching factor is the number of successors generated by a given node. The effective branching factor is the number of successors generated by a "typical" node for a given search problem.

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,339 answers
198,449 comments
105,204 users