Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
12.17 LAB: Merge sort The class 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 method, read Nums(), 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 method printNums(). An output has been added to mergeSort(), showing the indices that will be passed to the recursive method 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 static variable to count the comparisons. Note: Take special care to look at the output of each test to better understand the merge sort algorithm. Ex: When the input is: 6 3 2 1 598 the output is: unsorted: 321598 0 23 5 01 22 0 0 1 1 3 4 5 5 3 3 4 4 sorted: 1 2 3 5 89 comparisons: 8

12.17 LAB: Merge sort The class 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 method, read Nums(), 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 method printNums(). An output has been added to mergeSort(), showing the indices that will be passed to the recursive method 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 static variable to count the comparisons. Note: Take special care to look at the output of each test to better understand the merge sort algorithm. Ex: When the input is: 6 3 2 1 598 the output is: unsorted: 321598 0 23 5 01 22 0 0 1 1 3 4 5 5 3 3 4 4 sorted: 1 2 3 5 89 comparisons: 8

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

Write the full Java code for LabProgram.java

12.17 LAB: Merge sort The class 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 method, read Nums(), 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 method printNums(). An output has been added to mergeSort(), showing the indices that will be passed to the recursive method 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 static variable to count the comparisons. Note: Take special care to look at the output of each test to better understand the merge sort algorithm. Ex: When the input is: 6 3 2 1 598 the output is: unsorted: 321598 0 23 5 01 22 0 0 1 1 3 4 5 5 3 3 4 4 sorted: 1 2 3 5 89 comparisons: 8
Transcribed Image Text:12.17 LAB: Merge sort The class 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 method, read Nums(), 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 method printNums(). An output has been added to mergeSort(), showing the indices that will be passed to the recursive method 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 static variable to count the comparisons. Note: Take special care to look at the output of each test to better understand the merge sort algorithm. Ex: When the input is: 6 3 2 1 598 the output is: unsorted: 321598 0 23 5 01 22 0 0 1 1 3 4 5 5 3 3 4 4 sorted: 1 2 3 5 89 comparisons: 8
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

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