Find the smallest gap between two numbers in K. The algorithm should return the magnitude of the gap between the two closest integers. The algorithm(FINDGAP) should support Insert, delete and search in O(log n) time. And we maintain a dynamic set of integers. Example = [30, 5, 20, 9] Output = 9 - 5 = 4 a) Choose data structure to store the dynamic set of integers b) Create the algorithm FINDGAP and make it run as fast as possible. (PSEUDOCODE) c) Prove runningtime of FINDGAP and argue its optimal
Find the smallest gap between two numbers in K. The algorithm should return the magnitude of the gap between the two closest integers. The algorithm(FINDGAP) should support Insert, delete and search in O(log n) time. And we maintain a dynamic set of integers. Example = [30, 5, 20, 9] Output = 9 - 5 = 4 a) Choose data structure to store the dynamic set of integers b) Create the algorithm FINDGAP and make it run as fast as possible. (PSEUDOCODE) c) Prove runningtime of FINDGAP and argue its optimal
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
Find the smallest gap between two numbers in K.
The algorithm should return the magnitude of the gap between the two closest integers. The algorithm(FINDGAP) should support Insert, delete and search in O(log n) time. And we maintain a dynamic set of integers. Example = [30, 5, 20, 9] Output = 9 - 5 = 4
a) Choose data structure to store the dynamic set of integers
b) Create the algorithm FINDGAP and make it run as fast as possible. (PSEUDOCODE)
c) Prove runningtime of FINDGAP and argue its optimal
d) Make sure that running time of insert, delete and search are O(log N). Argue.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
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.Similar questions
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