1. Given an array B = {4, 20, 36, 45, 101, 175, 209, 332), show the steps to search for the value 200 in array B using sequential search, binary search and key-indexed search. Indicate the number of comparisons performed by each algorithm. Sequential Search Binary Search Key-indexed Search Steps # of Comparisons 2. Given an array storing integers ordered by value in increasing order, modify the binary search algorithm to return the position of the first integer with value K assuming K can appear multiple times in the array. Be sure that your algorithm is 0(log n), that is, do not use sequential search once an occurrence of K is found. 3. Given an array storing integers ordered by value in increasing order, modify the binary search algorithm to return the position of the integer with the greatest value less than K assuming K does not appear in the array. Return -1 if all values in the array are greater or equal K.

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

1. Given an array B = {4, 20, 36, 45, 101, 175, 209, 332}, show the steps to search for the value
200 in array B using sequential search, binary search and key-indexed search. Indicate the
number of comparisons performed by each algorithm.

2. Given an array storing integers ordered by value in increasing order, modify the binary search
algorithm to return the position of the first integer with value K assuming K can appear
multiple times in the array. Be sure that your algorithm is (log n), that is, do not use
sequential search once an occurrence of K is found.


3. Given an array storing integers ordered by value in increasing order, modify the binary search
algorithm to return the position of the integer with the greatest value less than K assuming K
does not appear in the array. Return -1 if all values in the array are greater or equal K.

1. Given an array B = {4, 20, 36, 45, 101, 175, 209, 332), show the steps to search for the value
200 in array B using sequential search, binary search and key-indexed search. Indicate the
number of comparisons performed by each algorithm.
Sequential Search
Binary Search
Key-indexed Search
Steps
# of Comparisons
2. Given an array storing integers ordered by value in increasing order, modify the binary search
algorithm to return the position of the first integer with value K assuming K can appear
multiple times in the array. Be sure that your algorithm is 0(log n), that is, do not use
sequential search once an occurrence of K is found.
3. Given an array storing integers ordered by value in increasing order, modify the binary search
algorithm to return the position of the integer with the greatest value less than K assuming K
does not appear in the array. Return -1 if all values in the array are greater or equal K.
Transcribed Image Text:1. Given an array B = {4, 20, 36, 45, 101, 175, 209, 332), show the steps to search for the value 200 in array B using sequential search, binary search and key-indexed search. Indicate the number of comparisons performed by each algorithm. Sequential Search Binary Search Key-indexed Search Steps # of Comparisons 2. Given an array storing integers ordered by value in increasing order, modify the binary search algorithm to return the position of the first integer with value K assuming K can appear multiple times in the array. Be sure that your algorithm is 0(log n), that is, do not use sequential search once an occurrence of K is found. 3. Given an array storing integers ordered by value in increasing order, modify the binary search algorithm to return the position of the integer with the greatest value less than K assuming K does not appear in the array. Return -1 if all values in the array are greater or equal K.
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Problems on Dynamic Programming
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
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