Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

bartleby

Concept explainers

Question

DO THIS USING 4 WHILE LOOPS!

no language of "break", "true" please

HW #5: Merging Sorted Lists
DUE Wednesday 3/2 at 12:44pm
As input, enter two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no
number repeats), both terminated by a -1. The size of each sequence can vary (maybe sequence-1 has four numbers, and
sequence-2 has seven).
You code needs to then output a third sequence that is a combination of sequence 1 and sequence 2, and is sorted in non-
decreasing order.
How is non-decreasing order different from increasing order?
This means there can be a repeated number in the third sequence (see Example runs 1&2 for examples of output with a
repeated number). A strictly increasing order sequence cannot have repeat numbers at all (Example runs 3 & 4 have output that
is in increasing order). Remember, all input sequences must be in strictly increasing order!
HINT: use three separate lists to solve this!
expand button
Transcribed Image Text:HW #5: Merging Sorted Lists DUE Wednesday 3/2 at 12:44pm As input, enter two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The size of each sequence can vary (maybe sequence-1 has four numbers, and sequence-2 has seven). You code needs to then output a third sequence that is a combination of sequence 1 and sequence 2, and is sorted in non- decreasing order. How is non-decreasing order different from increasing order? This means there can be a repeated number in the third sequence (see Example runs 1&2 for examples of output with a repeated number). A strictly increasing order sequence cannot have repeat numbers at all (Example runs 3 & 4 have output that is in increasing order). Remember, all input sequences must be in strictly increasing order! HINT: use three separate lists to solve this!
EXAMPLE RUN #1:
Input :
sequence-1 input: 2 7.3 20.3 99 102.7 -1
sequence-2 input: 10 20.3 77
-1
Output:
2 7.3 10 20.3 20.3 77 99 102.7
EXAMPLE RUN #2
Input :
sequence-1 input: 4 100 -1
sequence-2 input: 1 78 90.6 100 202 -1
Output:
1 4 78 90.6 100 100 202
expand button
Transcribed Image Text:EXAMPLE RUN #1: Input : sequence-1 input: 2 7.3 20.3 99 102.7 -1 sequence-2 input: 10 20.3 77 -1 Output: 2 7.3 10 20.3 20.3 77 99 102.7 EXAMPLE RUN #2 Input : sequence-1 input: 4 100 -1 sequence-2 input: 1 78 90.6 100 202 -1 Output: 1 4 78 90.6 100 100 202
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Computer Science
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
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education