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.

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
icon
Related questions
Question
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.
In this problem, you will be given a list of numbers. You have
to sort the list using the Merge Sort algorithm.
Pseudocode of Merge Sort Algorithm:
def merge(a, b):
# write your code here
# Here a and b are two sorted list
# merge function will return a sorted list after merging a and b
def mergeSort (arr):
if len(arr) <= 1:
return arr
else:
mid= len(arr)//2
al mergeSort(...
a2 = mergeSort (...
return merge (al, a2)
#write the parameter
#write the parameter
# complete the merge function above
Transcribed Image Text:In this problem, you will be given a list of numbers. You have to sort the list using the Merge Sort algorithm. Pseudocode of Merge Sort Algorithm: def merge(a, b): # write your code here # Here a and b are two sorted list # merge function will return a sorted list after merging a and b def mergeSort (arr): if len(arr) <= 1: return arr else: mid= len(arr)//2 al mergeSort(... a2 = mergeSort (... return merge (al, a2) #write the parameter #write the parameter # complete the merge function above
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.
Output:
You have to sort the number using the Merge Sort algorithm and
show the sorted list.
Sample Input/Output:
Sample Input 1
8
9 5 4 6 1 3 29
Sample Input 2
1
10
Sample Input 3.
6
8 1 4 2 1 3
Sample Input 4
7
7 6 5 4 3 2 1
Sample Output 1
1 2 3 4 5 699
Sample Output 2
10
Sample Output 3.
1 1 2 3 4 8
Sample Output 4.
1 2 3 4 5 6 7
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. Output: You have to sort the number using the Merge Sort algorithm and show the sorted list. Sample Input/Output: Sample Input 1 8 9 5 4 6 1 3 29 Sample Input 2 1 10 Sample Input 3. 6 8 1 4 2 1 3 Sample Input 4 7 7 6 5 4 3 2 1 Sample Output 1 1 2 3 4 5 699 Sample Output 2 10 Sample Output 3. 1 1 2 3 4 8 Sample Output 4. 1 2 3 4 5 6 7
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Arrays
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