Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 4, Problem 33R
Explanation of Solution
Running time of
It is given that Al and bob claims and argues about their algorithms. Al means that the
To prove the results, a set of operation is performed to check the result. If the input value of size “n” is less than 100 then the bob’s algorithm
Possibility of
”Yes”,
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
John tells you that a certain algorithm runs in time n(n2 +200n), and Bill tells you that the same
algorithm runs in time (n). Assume that both statements are correct, which one is more
informative, i.e., gives you a better estimation of the running time? Why?
It is found that the number of primitive operations required by an algorithm is log n!, where n is the size of the input. What is its Big-Oh time complexity of the algorithm? Give the time complexity in terms of the closest function.
Select one:
a.
O(n2)O(n2)
b. None of the above
c.
O(2n)O(2n)
d.
O(log n)O(log n)
e.
O(nn)O(nn)
2. For a problem we have come up with three algorithms: A, B, and C. Running time
of Algorithm A is O(n¹000), Algorithm B runs in 0(2¹) and Algorithm C runs in
O(n!). How do these algorithms compare in terms of speed, for large input?
Explain why.
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
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
- When the order of increase of an algorithm's running time is N log N, the doubling test leads to the hypothesis that the running time is a N for a constant a. Isn't that an issue?arrow_forwardSuppose 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)).arrow_forwardYou are given a collection of n bolts of different widths and n corresponding nuts. You are allowed to try a nut and bolt together, from which you can determine whether the nut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However, there is no way to compare two nuts together or two bolts together. The problem is to match each bolt to each nut. Design an algorithm for this problem with Θ(n log n) average-case complexity (in terms of nut-bolt comparisons). Explain why your algorithm has Θ(n log n) average case complexity.arrow_forward
- You are given a collection of n bolts of different widths and n corresponding nuts. You are allowed to try a nut and bolt together, from which you can determine whether the nut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However, there is no way to compare two nuts together or two bolts together. The problem is to match each bolt to each nut. Design an algorithm for this problem with Θ(n log n) average-case complexity (in terms of nut-bolt comparisons). Explain why your algorithm has Θ(n log n) average-case complexity. You may use any result without explicitly solving recurrence equations.arrow_forwardProve that the following algorithmfor computing Fibonacci numbers is correct. function fib(n) comment Return (Fn−1, Fn) 1. if n is odd then 2. (a, b) := even(n − 1) 3. return(b, a + b) 4. else return(even(n)) function even(n) comment Return (Fn−1, Fn) when n is even 1. if n = 0 then return(1, 0) 2. else if n = 2 then return(1, 1) 3. else if n = 4 then return(2, 3) 4. (a, b) := fib(n/2 − 1) 5. c := a + b; d := b + c 6. return(b · d + a · c, c · (d + b))arrow_forwardA computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are T,(n) = 3 n logn and T2(n) = n6/5 a) Which algorithm is better? Why? b) If we run both algorithms at the same time with an input size of 105, which algorithm produces results faster than the other one? Why?arrow_forward
- Find the running time for each of the following algorithms. Show work by finding a table of values for each while loop, writing the summations, then solving. Be sure to show work on both the upper bound and lower bound, justify the split, and check that the bounds differ by only a constant factor. Use asymptotic notation to write the answer. c) Func4(n) 1 2 3 4 567∞∞ s = 0; for i 1 to 5n do 8 j← 3i; while (j < i³) do s+ s + i - j; j+5 x j; end end 8 return (s);arrow_forward2. Algorithm A has a running time described by the recurrence T(n) = 7T(n/2) + n². A competing algorithm B has a running time described by the recurrence T(n) = aT (n/4) + n². What is the largest integer value for a such that B is asymptotically faster than A? Explain your answer.arrow_forwardIt is found that the number of primitive operations required by an algorithm is log n!, where n is the size of the input. What is its Big-Oh time complexity of the algorithm? Give the time complexity in terms of the closest function. Select one: O a. 0(2") Ob. O(n') O(log n) Od. O(n") e. None of the abovearrow_forward
- Correct answer will be upvoted else downvoted. Computer science. Polycarp recalled the 2020-th year, and he is content with the appearance of the new 2021-th year. To recall such a great second, Polycarp needs to address the number n as the amount of a specific number of 2020 and a specific number of 2021. For instance, if: n=4041, then, at that point, the number n can be addressed as the total 2020+2021; n=4042, then, at that point, the number n can be addressed as the total 2021+2021; n=8081, then, at that point, the number n can be addressed as the total 2020+2020+2020+2021; n=8079, then, at that point, the number n can't be addressed as the amount of the numbers 2020 and 2021. Assist Polycarp with seeing if the number n can be addressed as the amount of a specific number of numbers 2020 and a specific number of numbers 2021. Input The primary line contains one integer t (1≤t≤104) — the number of experiments. Then, at that point, t experiments follow.…arrow_forwardsuppose that n is not 2i for any integer i. How would we change the algorithm so that it handles the case when n is odd? I have two solutions: one that modifies the recursive algorithm directly, and one that combines the iterative algorithm and the recursive algorithm. You only need to do one of the two (as long as it works and does not increase the BigOh of the running time.)arrow_forwardThere are n different sizes of boxes, from 1 to n. There is an unlimited supply of boxes of each size t, each with a value vt . A box of size t can hold several smaller boxes of sizes a1, a2, . . . , ak as long as the sum of sizes a1 + a2 + . . . + ak is strictly less than t. Each of these boxes may be filled with yet more boxes, and so on. Design an algorithm which runs in O(n2 ) time and finds the maximum value that can be attained by taking one box, potentially with smaller boxes nested inside it.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 EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable 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