Explanation Given: Function f ( n ) = 2 f ( n 2 ) + 2 w h e n n = 2 k , where k is a positive integer and f ( 2 ) = 0 . Calculation: From Master Theorem, we have that if f is an increasing function that satisfies the recurrence relation f ( n ) = a f ( n b ) + c n d whenever n = b k where k is a positive integer, a ≥ 1 , b is an integer greater than 1, c and d are real numbers with c positive and d nonnegative. Then f ( n ) i s { O ( n d ) i f a < b d O ( n d log n ) i f a = b d O ( n log b a ) &#

8th Edition

ISBN: 9781260521337

Author: ROSEN

Publisher: MCG

See similar textbooks

Videos

Question

Chapter 8, Problem 23SE

To determine

A big-O estimate for the function f(n)=2f(n2)+2 when n=2k

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 8, Problem 22SE

Chapter 8, Problem 24SE

Students have asked these similar questions

Yue Bing is a new intern at Linkedln. She has designed a new recommendation algorithm for connecting LinkedIn users to other users, and wants to see if it will cause an increase the average number of messages sent by Linkedln users. She will randomly sample one group of users from the LinkedIn network and set up their accounts so that they use the new recommendation algorithm. She will then randomly sample another group of users, who will operate on the regular recommendation algorithm. She determines how many messages are sent by users over the course of year. She ends up assigning 23 users to the new algorithm, and 38 users to the old algorithm. She provides you with some of her data, though it is incomplete. Sample Size Sample Mean Standard Deviation New23 34.4 ?? Old 38 27.3 3.1 She insists all assumptions necessary for a confidence interval for a difference between two appropriate means have been verified. What distribution would we use to determine the critical value of a 95%…

How many total ways are there to select a group of five letters from the word ALGORITHM and arrange them in a straight line? How many distinguishable arrangements are there of the letters in the word BASSOONISTS?

Determine the least number of comparison needed to sort four elements and draw a binary tree that represents the algorithm that sorts these elements using this number of comparisons.

Chapter 8 Solutions

DISCRETE MATHEMATICS+ITS APPL. (LL)-W/A

Ch. 8.1 - Use mathematical induction to verify the formula...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - A vending machine dispensing books of stamps...Ch. 8.1 - A country uses as currency coins with values of 1...Ch. 8.1 - How many was are there to pay a bill of 17 pesos...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - a) Find a recurrence relation for the number of...

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

A big-O estimate for the function f ( n ) = 2 f ( n 2 ) + 2 w h e n n = 2 k

Solution Summary: The author explains the big-O estimate for the function f(n)=2f(n2)+2

Videos

A big-O estimate for the function f(n)=2f(n2)+2 when n=2k

Want to see the full answer?

Chapter 8 Solutions