(b) Set up a recurrence desginating a lower bound on the number of key comparisons. (c) Set up a recurrence designating an upper bound on the number of key comparisions.
(b) Set up a recurrence desginating a lower bound on the number of key comparisons. (c) Set up a recurrence designating an upper bound on the number of key comparisions.
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
100%
![Consider the following divide and conquer algorithm for searching for a value K in a sorted list
L[1.n]:
1
1. If the list is empty, then the element is not found. If the list contains only one element,
then simply compare it to the value K and act accordingly.
2. Otherwise, search recursively by comparing K with the element located at [n/4]. If it is
equal, then youre done. If its smaller then continue with the sublist to the left of [n/4].
3. If, on the other hand, its bigger than [n/4], then compare it with the element located at
[3n/4] and do exactly as you did in (2) i.e. you either found it at [3n/4] or you continue
with one of the sublists that are on the left or right of [3n/4].
(b) Set up a recurrence desginating a lower bound on the number of key comparisons.
(c) Set up a recurrence designating an upper bound on the number of key comparisions.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fea983c29-e48e-49e5-a2d0-09bf41641a44%2F43e4a7ce-c776-4232-a11a-bfcf2fe8bfce%2Femci0n_processed.png&w=3840&q=75)
Transcribed Image Text:Consider the following divide and conquer algorithm for searching for a value K in a sorted list
L[1.n]:
1
1. If the list is empty, then the element is not found. If the list contains only one element,
then simply compare it to the value K and act accordingly.
2. Otherwise, search recursively by comparing K with the element located at [n/4]. If it is
equal, then youre done. If its smaller then continue with the sublist to the left of [n/4].
3. If, on the other hand, its bigger than [n/4], then compare it with the element located at
[3n/4] and do exactly as you did in (2) i.e. you either found it at [3n/4] or you continue
with one of the sublists that are on the left or right of [3n/4].
(b) Set up a recurrence desginating a lower bound on the number of key comparisons.
(c) Set up a recurrence designating an upper bound on the number of key comparisions.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education