Alice and Bob are two friends. Alice has a sorted list in ascending order of length N. On the other hand, Bob has a sorted list of length M. Now, they want to make a sorted list of N+M length in ascending order. However, they are not very good at algorithms. Hence, they asked for your help. Since you are a computer science student, your task is to come up with an efficient algorithm. 1) Find a solution which runs in 0 (nlogn). 2) Come up with a solution which runs in 0(n).
Alice and Bob are two friends. Alice has a sorted list in ascending order of length N. On the other hand, Bob has a sorted list of length M. Now, they want to make a sorted list of N+M length in ascending order. However, they are not very good at algorithms. Hence, they asked for your help. Since you are a computer science student, your task is to come up with an efficient algorithm. 1) Find a solution which runs in 0 (nlogn). 2) Come up with a solution which runs in 0(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
Related questions
Question
Only need the ans for 2. Solve this using python. For the problem, take sample input from the picture into a file called
"input.txt" and save the output in the "output.txt" file.
![Alice and Bob are two friends. Alice has a sorted list in
ascending order of length N. On the other hand, Bob has a sorted
list of length M. Now, they want to make a sorted list of N+M
length in ascending order. However, they are not very good at
algorithms. Hence, they asked for your help.
Since you are a computer science student, your task is to come
up with an efficient algorithm.
1) Find a solution which runs in O(nlogn).
2) Come up with a solution which runs in 0 (n).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9a840716-d061-4ba9-9d68-92b5678ef9ba%2F096411bb-2fe6-49a7-9143-8de3ee4a7285%2Fw3xx97_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Alice and Bob are two friends. Alice has a sorted list in
ascending order of length N. On the other hand, Bob has a sorted
list of length M. Now, they want to make a sorted list of N+M
length in ascending order. However, they are not very good at
algorithms. Hence, they asked for your help.
Since you are a computer science student, your task is to come
up with an efficient algorithm.
1) Find a solution which runs in O(nlogn).
2) Come up with a solution which runs in 0 (n).
![Input
The first line contains an integer N ( 1 <= N <= 105), denoting
the length of Alice's sorted list. In the next line, there will
be N integers separated by space.
The third line contains another integer M ( 1 <= M <= 10³),
denoting the length of Bob's sorted list. In the next line,
there will be M integers separated by space.
All the numbers given in the input will fit in a 32-bit signed
integer.
It is guaranteed that the given lists will be in sorted order.
Output:
You have to make a sorted list in ascending order from the given
lists in ascending order and show the output.
Sample Input/Output:
Sample Input 1
4
1 3 5 7
4
2 248
Sample Input 2
Sample Output 1
1 2 2 3 4 5 7 8
Sample Output 2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9a840716-d061-4ba9-9d68-92b5678ef9ba%2F096411bb-2fe6-49a7-9143-8de3ee4a7285%2F1kqqnl7_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Input
The first line contains an integer N ( 1 <= N <= 105), denoting
the length of Alice's sorted list. In the next line, there will
be N integers separated by space.
The third line contains another integer M ( 1 <= M <= 10³),
denoting the length of Bob's sorted list. In the next line,
there will be M integers separated by space.
All the numbers given in the input will fit in a 32-bit signed
integer.
It is guaranteed that the given lists will be in sorted order.
Output:
You have to make a sorted list in ascending order from the given
lists in ascending order and show the output.
Sample Input/Output:
Sample Input 1
4
1 3 5 7
4
2 248
Sample Input 2
Sample Output 1
1 2 2 3 4 5 7 8
Sample Output 2
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education