Suppose Arr is a very large array of integer elements. The size of Arr is unknown. The first k elements are positive integers, greater than 0 and less than 1000, in increasing sorted order. The rest of the elements are greater than 1000. Write a function that determines whether a given positive integer, key, of value less than 1000 is an element in Arr or not. If the key is present in Arr, it returns its index otherwise it returns -1. The Time Complexity of the function shall be O(log(n)). (Note: It is to be remembered that both the size of Arr and k are unknown.) Array index is starting from 1 not 0 [pseudo code needed] Example: Arr: 4 5 7 12 15 24 67 221 233 430 500 1100 1200 1150 1050 1200 … key: 15 returned value: 5 Arr: 5 9 9 12 19 29 67 67 120 220 330 400 700 1001 1100 1150 1050 11250 1200 … key: 900 returned value: -1

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

Suppose Arr is a very large array of integer elements. The size of Arr is unknown. The first k elements are positive integers, greater than 0 and less than 1000, in increasing sorted order. The rest of the elements are greater than 1000.
Write a function that determines whether a given positive integer, key, of value less than 1000 is an element in Arr or not. If the key is present in Arr, it returns its index otherwise it returns -1. The Time Complexity of the function shall be O(log(n)).
(Note: It is to be remembered that both the size of Arr and k are unknown.)
Array index is starting from 1 not 0 [pseudo code needed]
Example:
Arr: 4 5 7 12 15 24 67 221 233 430 500 1100 1200 1150 1050 1200 …
key: 15
returned value: 5
Arr: 5 9 9 12 19 29 67 67 120 220 330 400 700 1001 1100 1150 1050 11250 1200 …
key: 900
returned value: -1

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Lists
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