The program is the same as shown at the end of the Merge sort section, with the following changes:Numbers are entered by a user in a separate helper function, ReadNums(), instead of defining a specific array in main(). The first number is how many integers to be sorted, and the rest are the integers.Output of the array has been moved to the helper function PrintNums().An output has been added to MergeSort(), showing the indices that will be passed to the recursive function calls.Add code to the merge sort algorithm to count the number of comparisons performed.Add code at the end of main() that outputs "comparisons: " followed by the number of comparisons performed (Ex: "comparisons: 12")Hint: Use a global variable to count the comparisons.Note: Take special care to look at the output of each test to better understand the merge sort algorithm.

code is given below in CPP along with output and code screenshots#include <iostream> #include <stdio.h> using namespace std; int aacount = 0; int n = 0; const int aaMAX_ITEMS = 100;void aamerge(int aavalues[], int aaleftFirst, int aaleftLast, int aarightFirst, int aarightLast); void aaprintarray(int a[], int n); void aamergesort(int a[], int aastart, int end){ if (aastart < end) { int aamid = (aastart + end) / 2; aamergesort(a, aastart, aamid); aamergesort(a, aamid + 1, end); aamerge(a, aastart, aamid, aamid + 1, end); } } void aamerge(int aavalues[], int aaleftFirst, int aaleftLast, int aarightFirst, int aarightLast) { int aatemparray[aaMAX_ITEMS]; int aaindex = aaleftFirst; int aasaveFirst = aaleftFirst; while ((aaleftFirst <= aaleftLast) && (aarightFirst <= aarightLast)) { if (aavalues[aaleftFirst] < aavalues[aarightFirst]) { aatemparray[aaindex] = aavalues[aaleftFirst]; aaleftFirst++; } else { aatemparray[aaindex] = aavalues[aarightFirst]; aarightFirst++; } aaindex++; aacount++; } while (aaleftFirst <= aaleftLast) { aatemparray[aaindex] = aavalues[aaleftFirst]; aaleftFirst++; aaindex++; } while (aarightFirst <= aarightLast) { aatemparray[aaindex] = aavalues[aarightFirst]; aarightFirst++; aaindex++; } for (aaindex = aasaveFirst; aaindex <= aarightLast; aaindex++) aavalues[aaindex] = aatemparray[aaindex]; aaprintarray(aavalues, n); cout << endl; } void aaprintarray(int a[], int n) { for (int i = 0; i < n; i++) cout << a[i] << " "; } int main() { cout << "Total element : "; cin >> n; int a[aaMAX_ITEMS]; for (int i = 0; i < n; i++) { if (i == 0) cout << "Element 1: "; else cout << "Enter the next element: "; cin >> a[i]; } int aastart = 0; int end = n - 1; aamergesort(a, aastart, end); aaprintarray(a, n); cout << endl; cout << "Number of comparisons : " << aacount << endl; }

Answered: The program is the same as shown at the…

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

Related questions

Question

The program is the same as shown at the end of the Merge sort section, with the following changes:

Numbers are entered by a user in a separate helper function, ReadNums(), instead of defining a specific array in main(). The first number is how many integers to be sorted, and the rest are the integers.
Output of the array has been moved to the helper function PrintNums().
An output has been added to MergeSort(), showing the indices that will be passed to the recursive function calls.

Add code to the merge sort algorithm to count the number of comparisons performed.

Add code at the end of main() that outputs "comparisons: " followed by the number of comparisons performed (Ex: "comparisons: 12")

Hint: Use a global variable to count the comparisons.

Note: Take special care to look at the output of each test to better understand the merge sort algorithm.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 5 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON