Show how the mergesort algorithm executes on the string MATERIAL You should recall from lecture that we can use a graph to visualize the merge sort algorithm. At the very top of the graph, you have one node representing the original input list. At the very bottom, you have one node representing a sorted version of your input list. In the middle, you have nodes and edges representing the steps you take to execute merge sort. For this question, you are to execute the merge sort algorithm and show your work, with the provided string for input. You will consider each character in the input string as an element in an input list to merge sort. For example, the string "HELLO" would mean you input the list ["H", "E", "L", "L", "O"] into the merge sort algorithm.
Show how the mergesort algorithm executes on the string MATERIAL You should recall from lecture that we can use a graph to visualize the merge sort algorithm. At the very top of the graph, you have one node representing the original input list. At the very bottom, you have one node representing a sorted version of your input list. In the middle, you have nodes and edges representing the steps you take to execute merge sort. For this question, you are to execute the merge sort algorithm and show your work, with the provided string for input. You will consider each character in the input string as an element in an input list to merge sort. For example, the string "HELLO" would mean you input the list ["H", "E", "L", "L", "O"] into the merge sort algorithm.
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...
Related questions
Question
![Show how the mergesort algorithm executes on the string MATERIAL
You should recall from lecture that we can use a graph to visualize the merge sort algorithm. At the very top of the
graph, you have one node representing the original input list. At the very bottom, you have one node representing a
sorted version of your input list. In the midle, you have nodes and edges representing the steps you take to execute
merge sort.
For this question, you are to execute the merge sort algorithm and show your work, with the provided string for
input. You will consider each character in the input string as an element in an input list to merge sort. For example,
the string "HELLO" would mean you input the list ["H", "E", "L", "L", "O"] into the merge sort algorithm.
Fòr convenience, the pseudocode of the mergesort algorithm is shown below:
MergeSort(array V, int p, int r) {
if (p = r) then // do nothing
else {
// we have at least 2 items
q = (p + r)/2
MergeSort(V, p, q) // sort V[p..a]
MergeSort(V, q+1, r) // sort V[q+1.r]
Merge(V, p, q, r) // merge everything together
Merge(array V, int p, int q, int r) {
// merges V[p..g] with V[q+1.r]
// declare a temporary array S to store
// the sorted sequence
array S[p..r]
i = k = p// initialize pointers
j = q+1
while (i <= q and j <= r) {
// while both subarrays are nonempty
if (V[i] <= V[j]) then
// copy from left subarray
S[k++] = V[i++]
else
// copy from right subarray
S[k++] = V[i++]
%3D
// copy any leftover to S from the left subarray
while (i <= q) do
S[k++] = V[i++]
// copy any leftover to S from the right subarray
while (j <= r) do
S[k++] = V[j++]
// copy S back to V
for i = p to r do V[i) = S[i]
%3D
%3D](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F183ee7e8-b711-4dd7-b072-d0d5e1b740e4%2Fc611d375-1ac1-4fd7-8857-c45c4efe7898%2Fpo73j4o_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Show how the mergesort algorithm executes on the string MATERIAL
You should recall from lecture that we can use a graph to visualize the merge sort algorithm. At the very top of the
graph, you have one node representing the original input list. At the very bottom, you have one node representing a
sorted version of your input list. In the midle, you have nodes and edges representing the steps you take to execute
merge sort.
For this question, you are to execute the merge sort algorithm and show your work, with the provided string for
input. You will consider each character in the input string as an element in an input list to merge sort. For example,
the string "HELLO" would mean you input the list ["H", "E", "L", "L", "O"] into the merge sort algorithm.
Fòr convenience, the pseudocode of the mergesort algorithm is shown below:
MergeSort(array V, int p, int r) {
if (p = r) then // do nothing
else {
// we have at least 2 items
q = (p + r)/2
MergeSort(V, p, q) // sort V[p..a]
MergeSort(V, q+1, r) // sort V[q+1.r]
Merge(V, p, q, r) // merge everything together
Merge(array V, int p, int q, int r) {
// merges V[p..g] with V[q+1.r]
// declare a temporary array S to store
// the sorted sequence
array S[p..r]
i = k = p// initialize pointers
j = q+1
while (i <= q and j <= r) {
// while both subarrays are nonempty
if (V[i] <= V[j]) then
// copy from left subarray
S[k++] = V[i++]
else
// copy from right subarray
S[k++] = V[i++]
%3D
// copy any leftover to S from the left subarray
while (i <= q) do
S[k++] = V[i++]
// copy any leftover to S from the right subarray
while (j <= r) do
S[k++] = V[j++]
// copy S back to V
for i = p to r do V[i) = S[i]
%3D
%3D
Expert Solution
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 2 steps with 1 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY