(c) Suppose you are given a set of 100m sprint times from the 2020 olympics. The input list has sizen and is not sorted, and you may assume that each time is distinct (there are no exact ties). Your team-mate completed in the event, and her time was exactly 10.57 seconds. She returns from the olympics upset, claiming that at least half the competitors had a faster time. Design an algorithm that takes as input the array A consisting of the n sprint times, and outputs the closest n/4 sprint times that are faster than your friend's time. Justify why your algorithm runs in O(n) in the worst case. *For simplicity, you may assume n/4 is an integer
(c) Suppose you are given a set of 100m sprint times from the 2020 olympics. The input list has sizen and is not sorted, and you may assume that each time is distinct (there are no exact ties). Your team-mate completed in the event, and her time was exactly 10.57 seconds. She returns from the olympics upset, claiming that at least half the competitors had a faster time. Design an algorithm that takes as input the array A consisting of the n sprint times, and outputs the closest n/4 sprint times that are faster than your friend's time. Justify why your algorithm runs in O(n) in the worst case. *For simplicity, you may assume n/4 is an integer
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
Expert Solution
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
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