2. Suppose the above algorithm performs a recursive call of size 75% for the first recursive call, with everything else remaining the same. What is the big-Oh run time for this algorithm now?
2. Suppose the above algorithm performs a recursive call of size 75% for the first recursive call, with everything else remaining the same. What is the big-Oh run time for this algorithm now?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Need help with Question #2.
Question #1 has been provided to you for sample reference along with the work.

Transcribed Image Text:1. Suppose a recursive algorithm performs 2 recursive calls. Assume the first recursive call is
of size at most 70% the original input size, and the second call is of size at most 25% of the
original input size. In addition, the algorithm performs O(n) additional work after making
these recursive calls. What is the big-Oh run time of this algorithm?
Solt
Suppose total recursive call is l00% ie 'n' times
So, maximum height of Hhe tree is:
firet Call recursive sige atmost toy. (-e 3n'
1
Second recursive call size atmost ie 'n'
:(총)"
So, re cuTrcnce relation i'!
take 'log'
both sidy,we get
on
T(n) = 3T
(2) +
T(4)
log n
K
%3D
Addlitional
time
using tree methed t
→ o(n)
S, Maximum number of level is
and
each level
take time of oln)
6o, to tal time Compleuty is
ocn)
3n
→ o(n)
K' steps
als.

Transcribed Image Text:2. Suppose the above algorithm performs a recursive call of size 75% for the first recursive call,
with everything else remaining the same. What is the big-Oh run time for this algorithm
now?
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps

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.Recommended textbooks for you

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

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