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).
Your 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!
Extracted text: EXAMPLE RUN #3 Input : sequence-1 input: 2 -1 sequence-2 input: 1 -1 Output: 1 2 EXAMPLE RUN #4 Input : sequence-1 input: 1 3 5 7 -1 sequence-2 input: 2 4 6 8 -1 Output: 1 2 3 4 5 6 7 8
Extracted 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