Computer Science, asked by akrobin, 5 months ago

Solve the recurrence relation:

T(n) = c , n = 1
T(n) = 2T(n/2) + c , n > 1

Answers

Answered by mk3161961886

0

Answer:

this

Explanation:

it is a 2nd year class question

Previous Question

Next Question

Similar questions

Math, 2 months ago

write the numerical and literal coefficient of -pz?

Social Sciences, 2 months ago

B. Fill in the blanks. 1. The process by which the president is removed from office is called _______ . 2. The _________is the commander-in-chiefof the Indian Armed Forces. 3. The vice president is the presiding officer of the _______ _______ . 4. The ______ _______is the leaderof the majority party that forms the government at the centre. 5. The body which consists of senior minister in...

Computer Science, 2 months ago

cell H7 is in the column ------- and row --------...

Math, 5 months ago

Date. Page. О a The Perimeter of Parallelogram is 3oom , If the site Shooter side measuge ban then find the measure of longo side a 9cm (be 5cm c) 21 cm...

Math, 5 months ago

15) In the given figure; 2C = 90° and D is mid- point of AC. Find : 15 (i) tan ZCAB tan ZCDB (ii) tanZABC tan ZDBC D B do...

Math, 10 months ago

vertically opposite Kenya lines India in lines ready Ka Tarika...

English, 10 months ago

In the sentence walking and walk what is different...

Social Sciences, 10 months ago

The main cause of land degradation in Punjab is ______...