Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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 O(n). Input The first line contains an integer N ( 1 <= N <= 10), 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 1357 4 2248 Sample Input 2 3 2 10 12 346789 Sample Input 3 4 1234 1 10 Sample Input 4 7 2 3 8 8 10 12 14 1 1 4 5 6 8 13 15 16 Sample Output 1 1 2 2 3 4 5 7 8 Sample Output 2 2 3 4 6 7 8 9 10 12 Sample Output 3 1 2 3 4 10 Sample Output 4 1 1 2 3 4 5 6 8 8 8 10 12 13 14 15 16

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 O(n). Input The first line contains an integer N ( 1 <= N <= 10), 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 1357 4 2248 Sample Input 2 3 2 10 12 346789 Sample Input 3 4 1234 1 10 Sample Input 4 7 2 3 8 8 10 12 14 1 1 4 5 6 8 13 15 16 Sample Output 1 1 2 2 3 4 5 7 8 Sample Output 2 2 3 4 6 7 8 9 10 12 Sample Output 3 1 2 3 4 10 Sample Output 4 1 1 2 3 4 5 6 8 8 8 10 12 13 14 15 16

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

kindly solve this problem using python 

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. Input The first line contains an integer N ( 1 <= N <= 10³), denoting the length of Alice's sorted list. In the next line, there will be N integers separated by space. 1) Find a solution which runs in 0 (nlogn). 2) Come up with a solution which runs in 0 (n). 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 2248 Sample Input 2 3 2 10 12 6 3 4 6 7 8 9 Sample Input 3. 4 ddd 1 2 3 4 1 10 Sample Input 4 7 2 3 8 8 10 12 14 9 1 1 4 5 6 8 13 15 16 Sample Output 1 1 2 2 3 4 5 7 8 Sample Output 2 2 3 4 6 7 8 9 10 12 Sample Output 3 1 2 3 4 10 Sample Output 4 1 1 2 3 4 5 6 8 8 8 10 12 13 14 15 16
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. Input The first line contains an integer N ( 1 <= N <= 10³), denoting the length of Alice's sorted list. In the next line, there will be N integers separated by space. 1) Find a solution which runs in 0 (nlogn). 2) Come up with a solution which runs in 0 (n). 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 2248 Sample Input 2 3 2 10 12 6 3 4 6 7 8 9 Sample Input 3. 4 ddd 1 2 3 4 1 10 Sample Input 4 7 2 3 8 8 10 12 14 9 1 1 4 5 6 8 13 15 16 Sample Output 1 1 2 2 3 4 5 7 8 Sample Output 2 2 3 4 6 7 8 9 10 12 Sample Output 3 1 2 3 4 10 Sample Output 4 1 1 2 3 4 5 6 8 8 8 10 12 13 14 15 16
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS