Design an efficient algorithm (pseudo code) that track the k shortest strings (not sorted) seen so far, assuming a string length function that takes unit time. The strings are presented in “streaming” fashion and cannot be revisited if not saved. For example, if we want to keep 3 shortest strings (k = 3) from the following input stream: cat, watermelon, elephant, milk, rocket88; the output result is cat, milk, elephant. Analyze the complexity of your algorithm in terms the required number k of shortest strings, and the input stream size n.

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

Design an efficient algorithm (pseudo code) that track the k shortest strings (not
sorted) seen so far, assuming a string length function that takes unit time. The strings are
presented in “streaming” fashion and cannot be revisited if not saved. For example, if we want
to keep 3 shortest strings (k = 3) from the following input stream: cat, watermelon, elephant, milk,
rocket88; the output result is cat, milk, elephant. Analyze the complexity of your algorithm in terms the
required number k of shortest strings, and the input stream size n. 

Expert Solution
steps

Step by step

Solved in 3 steps

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