Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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 2248 Sample Input 2 Sample Output 1 1 2 2 3 4 5 7 8 Sample Output 2

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 2248 Sample Input 2 Sample Output 1 1 2 2 3 4 5 7 8 Sample Output 2

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Only need the ans for 1. 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.
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
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
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).
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).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS