in Combinatory
361 views
0 votes
0 votes
Find $f (n)$ when $n = 2^{k},$ where $f$ satisfies the recurrence relation $f (n) = f (n/2) + 1 \:\text{with}\: f (1) = 1.$
in Combinatory
by
361 views

1 Answer

1 vote
1 vote

Use Master Theorem with  $ a = 1, b = 2, c = 1, d = 0.$

Since $ a = b^{ d} ,(d=log_{a}b)$

we know that f(n) is   $ O(n^{ d} log n) = O(log n).$

edited by

Related questions

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