Question 2: Recurrences (a) Below is the pseudo-code for two algorithms: Practicel(A,s,f) and Practice2(A,s,f), which take as input a sorted array A, indexed from s to f. The algorithms make a call to Bsearch(A,s,f,k) which we saw in class. Determine the worst-case runtime recurrence for each algorithm: T1(n) and T2(n). Show that T1(n) is O((log n)²) and T2(n) is 0(n log n). Practicel (A,s,f) if s < f ql = [(s+ f)/2] if BSearch(A,s,q1,1) = true Practice2(A,s,f) if s< f if BSearch(A,s+1,f,1) = true return true return true else else return Practice2(A, s, f-1) return Practicel(A, ql+1, f) else else return false return false
Question 2: Recurrences (a) Below is the pseudo-code for two algorithms: Practicel(A,s,f) and Practice2(A,s,f), which take as input a sorted array A, indexed from s to f. The algorithms make a call to Bsearch(A,s,f,k) which we saw in class. Determine the worst-case runtime recurrence for each algorithm: T1(n) and T2(n). Show that T1(n) is O((log n)²) and T2(n) is 0(n log n). Practicel (A,s,f) if s < f ql = [(s+ f)/2] if BSearch(A,s,q1,1) = true Practice2(A,s,f) if s< f if BSearch(A,s+1,f,1) = true return true return true else else return Practice2(A, s, f-1) return Practicel(A, ql+1, f) else else return false return false
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
![Question 2: Recurrences
(a) Below is the pseudo-code for two algorithms: Practicel (A,s,f) and Practice2(A,s,f), which take as
input a sorted array A, indexed from s to f. The algorithms make a call to Bsearch(A,s,f,k) which we
saw in class. Determine the worst-case runtime recurrece for each algorithm: T1(n) and T2(n). Show that
T(n) is O((log n)²) and T2(n) is O(n log n).
Practicel (A,s,f)
if s< f
ql = L(s+ f)/2]
if BSearch(A,s,ql,1) = true
Practice2(A,s,f)
if s < f
if BSearch(A,s+1,f,1) = true
return true
return true
else
else
return Practice2(A, s, f-1)
return Practicel(A, ql+1, f)
else
else
return false
return false](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0ac78e14-45fa-42b2-86c0-47e5eaac311c%2Fc899dfe5-c547-4ac3-a44a-475d6835fa77%2Fg92vo55_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Question 2: Recurrences
(a) Below is the pseudo-code for two algorithms: Practicel (A,s,f) and Practice2(A,s,f), which take as
input a sorted array A, indexed from s to f. The algorithms make a call to Bsearch(A,s,f,k) which we
saw in class. Determine the worst-case runtime recurrece for each algorithm: T1(n) and T2(n). Show that
T(n) is O((log n)²) and T2(n) is O(n log n).
Practicel (A,s,f)
if s< f
ql = L(s+ f)/2]
if BSearch(A,s,ql,1) = true
Practice2(A,s,f)
if s < f
if BSearch(A,s+1,f,1) = true
return true
return true
else
else
return Practice2(A, s, f-1)
return Practicel(A, ql+1, f)
else
else
return false
return false
Expert Solution
Step 1
For algorithm 1
From the above pseudo code we have
The worst case time complexity will be
( T(0)+T(n))/2
By getting the big O notation of it. It will be
O (n)/2.
Therefore the worst case time complexity for the 1st algorithm is O(n)/2
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