a) function func(A,n) if n ≤ 5 then return A(1) else for i=1 to n for j = i to n-1 Ail(i) + A/i) + 2

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
icon
Related questions
Question
2. Write a recurrence relation describing the worst case running time of each of the following
algorithms and determine the asymptotic complexity of the function defined by the
recurrence relation. Justify your solution. You may not use the Master Theorem as
justification of your answer. Simplify and express your answer as (nk) or (nk log₂ n)
whenever possible. If the algorithm is exponential just give exponential lower bounds.
a) function func(A,n)
if n ≤ 5 then return A(1)
else
for i=1 to n
for j = i to n-1
A(j) A(j) + A(i) + 3
/* endfor */
/* endfor */
wwwwwwwwww
y ← func(A, n-6)
return (y)
Transcribed Image Text:2. Write a recurrence relation describing the worst case running time of each of the following algorithms and determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution. You may not use the Master Theorem as justification of your answer. Simplify and express your answer as (nk) or (nk log₂ n) whenever possible. If the algorithm is exponential just give exponential lower bounds. a) function func(A,n) if n ≤ 5 then return A(1) else for i=1 to n for j = i to n-1 A(j) A(j) + A(i) + 3 /* endfor */ /* endfor */ wwwwwwwwww y ← func(A, n-6) return (y)
b) function func(A,n)
if n <= 2 then return A(1)
y func(A, floor(n/3))
for i = n-5 to n
y + y + A(i) + 3
/* endfor */
return (y)
Transcribed Image Text:b) function func(A,n) if n <= 2 then return A(1) y func(A, floor(n/3)) for i = n-5 to n y + y + A(i) + 3 /* endfor */ return (y)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Time complexity
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education