Write a recursive function named merge_sort that sorts a given list using the recursive algorithm of merge sort. Implement and use the helper function _merge , which merges two sorted arrays. Sample Output > merge_sort([10, 32, 83, 2, 72, 100, 32]) [2, 10, 32, 32, ] > merge_sort(['a','g','a','t','e']) ['a','a','g','e', 't'] In [ ]: def _merge(P, Q): ""merges two sorted arrays INPUT: * P. 0 - the two sorted arrays OUTPUT: a sorted list consisting of elements in P and Q pass In [ ]: def merge_sort(array): ""sorts a given list INPUT: * array - the list OUTPUT: a sorted copy of the list. pass

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
100%

Please solve both parts of the question(the entire problem). Thank you!

Part I
Write a recursive function named merge_sort that sorts a given list using the recursive algorithm of merge sort. Implement and use the helper function
_merge , which merges two sorted arrays.
Sample Output
> merge_sort([10, 32, 83, 2, 72, 100, 32])
[2, 10, 32, 32, ]
> merge_sort ( ['a','g','a', 't','e'])
['a','a','g','e', 't']
In [ ]: def _merge(P, Q):
""merges two sorted arrays
INPUT:
* P, Q - the two sorted arrays
OUTPUT: a sorted list consisting of elements in P and Q
pass
In [ ]: def merge_sort(array):
""sorts a given list
INPUT:
* array - the list
OUTPUT: a sorted copy of the list.
pass
Part II
Use a proof by induction to show that the function merge_sort will correctly sort any array of size n.
Proof
Type your answer here. Use to type LaTeX math expressions, e.g. p A q
Transcribed Image Text:Part I Write a recursive function named merge_sort that sorts a given list using the recursive algorithm of merge sort. Implement and use the helper function _merge , which merges two sorted arrays. Sample Output > merge_sort([10, 32, 83, 2, 72, 100, 32]) [2, 10, 32, 32, ] > merge_sort ( ['a','g','a', 't','e']) ['a','a','g','e', 't'] In [ ]: def _merge(P, Q): ""merges two sorted arrays INPUT: * P, Q - the two sorted arrays OUTPUT: a sorted list consisting of elements in P and Q pass In [ ]: def merge_sort(array): ""sorts a given list INPUT: * array - the list OUTPUT: a sorted copy of the list. pass Part II Use a proof by induction to show that the function merge_sort will correctly sort any array of size n. Proof Type your answer here. Use to type LaTeX math expressions, e.g. p A q
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

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