Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 4, Problem 49C
Consider the following “justification” that the Fibonacci function, F(n) is O(n): Base case (n ≤ 2): F(1) = 1 and F(2) = 2.
Induction step (n > 2): Assume claim true for n′ < n. Consider n. F(n) = F(n − 2) + F(n − 1). By induction, F(n − 2) is O(n − 2) and F(n − 1) is O(n − 1). Then, F(n) is O((n − 2) + (n − 1)), by the identity presented in Exercise R-4.16.
Therefore, F(n) is O(n).
What is wrong with this “justification”?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
By using recursive approach perform the following first 3 problems by using
functions in Java
Anlyse their working mechanisms and check their correctness
Comment on their T(n)
Heuristics Prove or disprove: If h1(n), ..., hk(n) are admissible, so is h(n) = h1(n) + ... + hk(n)
Suppose that f (n) = 0(g(n)) and f(n) = 0(h(n)), then it is ( always / sometimes / never ) the case that g(n) = 0(h(n)).
Chapter 4 Solutions
Data Structures and Algorithms in Java
Ch. 4 - Prob. 1RCh. 4 - The number of operations executed by algorithms A...Ch. 4 - The number of operations executed by algorithms A...Ch. 4 - Prob. 4RCh. 4 - Prob. 5RCh. 4 - Prob. 6RCh. 4 - Prob. 7RCh. 4 - Prob. 8RCh. 4 - Prob. 9RCh. 4 - Prob. 10R
Ch. 4 - Prob. 11RCh. 4 - Prob. 12RCh. 4 - Prob. 13RCh. 4 - Prob. 14RCh. 4 - Prob. 15RCh. 4 - Prob. 16RCh. 4 - Prob. 17RCh. 4 - Prob. 18RCh. 4 - Prob. 19RCh. 4 - Prob. 20RCh. 4 - Prob. 21RCh. 4 - Prob. 22RCh. 4 - Show that 2n+1 is O(2n).Ch. 4 - Prob. 24RCh. 4 - Prob. 25RCh. 4 - Prob. 26RCh. 4 - Prob. 27RCh. 4 - Prob. 28RCh. 4 - Prob. 29RCh. 4 - Prob. 30RCh. 4 - Prob. 31RCh. 4 - Prob. 32RCh. 4 - Prob. 33RCh. 4 - Prob. 34RCh. 4 - Prob. 35CCh. 4 - Prob. 36CCh. 4 - Prob. 37CCh. 4 - Prob. 38CCh. 4 - Prob. 39CCh. 4 - Prob. 40CCh. 4 - Prob. 41CCh. 4 - Prob. 42CCh. 4 - Prob. 43CCh. 4 - Draw a visual justification of Proposition 4.3...Ch. 4 - Prob. 45CCh. 4 - Prob. 46CCh. 4 - Communication security is extremely important in...Ch. 4 - Al says he can prove that all sheep in a flock are...Ch. 4 - Consider the following justification that the...Ch. 4 - Consider the Fibonacci function, F(n) (see...Ch. 4 - Prob. 51CCh. 4 - Prob. 52CCh. 4 - Prob. 53CCh. 4 - Prob. 54CCh. 4 - An evil king has n bottles of wine, and a spy has...Ch. 4 - Prob. 56CCh. 4 - Prob. 57CCh. 4 - Prob. 58CCh. 4 - Prob. 59CCh. 4 - Prob. 60PCh. 4 - Prob. 61PCh. 4 - Perform an experimental analysis to test the...Ch. 4 - Prob. 63P
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
The ____________ is always transparent.
Web Development and Design Foundations with HTML5 (8th Edition)
Use the following tables for your answers to questions 3.7 through 3.51 : PET_OWNER (OwnerID, OwnerLasst Name, ...
Database Concepts (8th Edition)
(Printing a Question Mark as a Character Constant) Write a program that determines whether can be printed as th...
C How to Program (8th Edition)
Write a loop equivalent to the for loop above without using .
C Programming Language
What are the possible output sequences from the following program? ____________________________________code/ecf...
Computer Systems: A Programmer's Perspective (3rd Edition)
On the planet Gzyx, a ball dropped from a height of 20 ft hits the ground in 2 s. If a ball is dropped from the...
Differential Equations: Computing and Modeling (5th Edition), Edwards, Penney & Calvis
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Solve the recurrence relation: T (n) = T (n/2) + T (n/4) + T (n/8) + n. Use the substitution method, guess that the solution is T (n) = 0 (n log n). Solve the recurrence relation T (n) = T ( √n) + c. n > 4 Derive the runtime of the below codearrow_forward7. Prove or disprove: f(n) + g(n) = 0 (min(f(n), g(n)))arrow_forward7. For n 2 1, in how many out of the n! permutations T = (T(1), 7(2),..., 7 (n)) of the numbers {1, 2, ..., n} the value of 7(i) is either i – 1, or i, or i +1 for all 1 < i < n? Example: The permutation (21354) follows the rules while the permutation (21534) does not because 7(3) = 5. Hint: Find the answer for small n by checking all the permutations and then find the recursive formula depending on the possible values for 1(n).arrow_forward
- 6. Prove: For all integers n, if n² is odd, then n is odd. Use a proof by contraposition, as in Lemma 1.1.arrow_forwardf(n) = O(f(n)g(n)) Indicate whether the below is true or false. Explain your reasoning. For all functions f(n) and g(n):arrow_forwardes remaining 8. Consider the function f:NxN-N defined recursively by: 1) Base case: Let meN and define (0,m) = 0 2) Recursive case: For any x,meN, x>0, define f(x,m) = (x-1,m) + (m+m) Prove the following theorem holds using proof by induction: Thereom: For any n,meN, m>0 we have (n.m) I m = n+n Fill in your answer here 9 Help BIU X, x L - ɔE =N E X Formatarrow_forward
- Solve the following recurrence equations by expanding the formulas (also called the 'iteration method' on slides). Specifically, you should get T(n) = O(f(n)) for a function f(n). You may assume that T(n) = O(1) for n = O(1). You should not use the Master Theorem. (a) T(n) = 2T (n/3) + 1. (b) T(n) = 7T(n/7) + n. (c) T(n) = T(n − 1) + 2.arrow_forwardLet S = {3n :neZ}.A recursive definition for the set S is: %3D Basis Step: 3 ES Recursive Step: If x E S then a +3 E S Prove by structural induction that for every x E S, x+x E S. Hint: Use the recursive definition of S to set up your proof by structural induction and use the definition S = {3n : n e Z*} in your proof. + Drag and drop an image or PDF file or click to browse...arrow_forwardA) Prove the following by induction, substitution, or by definition that 5n²- n +1 = O(n) Definition of Big Theta f(n) = © (g(n)) means there are positive constants c1, c2, and no, such that 0 ≤ c1g(n) ≤ f(n) ≤ c2g(n) for all n ≥ no. B) If this is not Theta, what is it?arrow_forward
- 3. I: II T(n) = 27)+n², then T(n) = O(nlogn). II: If T(n) = ! 27()+nlogn, then T(n) = O(nlogn). III: If T(n) = 2T(√) + logn, then T(n) = O(logn log n). (A) Only I is TRUE. (B) Only II is TRUE. (C) Only III is TRUE. (D)All of LII and III are TRUE. 4. (a) 5%Show that the lower bound for the sorting problem is (nlogn). (b) 3% The least signifcant digit first RadixSort sorts n numbers in O(n) and it beats the (nlogn) lower bound. What went wrong? (c) 5% Prove correctness of the O(n) time least significant digit first RadixSort. (d) 4% Show that finding the convex hull of n points in 2D space needs at least (nlogn) time. (e) 3% Show that finding the convex hull of n points in 3D spaceneeds at least (nlogn) time.arrow_forwardf(n) = 1 if n is odd f(n) = n if n is even 1. Prove/disprove that f(n) is O(n) (Big-Oh) 2. Prove/disprove that f(n) is Omega (n) 3. Prove/disprove that f(n) is Theta (n)arrow_forwardAnswer the following short questions:a) Is 2n+1 = O(2n)? b) Is 22n = O(2n)?c) f(n)=O(g(n)) implies g(n)=O(f(n))d) f(n) = O((f(n))2)arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Binary Numbers and Base Systems as Fast as Possible; Author: Techquikie;https://www.youtube.com/watch?v=LpuPe81bc2w;License: Standard YouTube License, CC-BY
Binary Number System; Author: Neso Academy;https://www.youtube.com/watch?v=w7ZLvYAi6pY;License: Standard Youtube License