Computing time results for Heap sort and Merge sort Program plan: ArrayUtil.java: Include the required header file. Define the class “ArrayUtil”. Define a “randomIntArray” method. This function generates random number for sorting Define a “swap()” method. This function swaps the two entries of an array. MergeSorter.java: Define the class “MergerSorter”. Define a “sort()” method. This sorts an array using merge sort. Define a “merge()” method. This function merge the two sorted arrays into an array. HeapSorter.java: Define a class “HeapSorter”. Define a “sort()” method. This function sorts the given array using selection sort. Define a “fixHeap()” method. This function confirms the heap property for a subtree. Ensures that the children nodes fulfil the heap property. Define a “getLeftChildIndex()” method. This returns the left child of the subtree. Define a “getRightChildIndex()” method. This returns the right child of the subtree. StopWatch.java: Define a class “StopWatch”. Define a constructor “StopWatch()”. This generates the stopwatch in stopped state. Define a “start()” function. This starts the stopwatch. Define a “stop()” function. This stops the stopwatch and add this time to elapsed time. Define a “getElapsedTime()”. This returns the total elapsed time. Define a “reset()” function. This resets the elapsed time to 0 and “isRunnning” to false. SorterTimer.java: Define the class “SorterTimer”. ○ Define the “main()”. Create Scanner object as “in”. Read the input from the user for array size. Generate a random array using “ArrayUtil” class. Create an object for “StopWatch” as “timer”. Call the “Stopwatch” member function “start()”. Next call the “sort()” function from MergeSorter. Then stop the stopwatch using “stop()” function. Print the value of time taken by merge sort. Create an object for “StopWatch” as “timer”. Call the “Stopwatch” member function “start()”. Next call the “sort()” function from “HeapSorter”. Then stop the stopwatch using “stop()” function. Print the value of time taken by heap sort.

Question

Want to see the full answer?

Answer 1

Question

Chapter 17, Problem 13PE

Program Plan Intro

Computing time results for Heap sort and Merge sort

Program plan:

ArrayUtil.java:

Include the required header file.

Define the class “ArrayUtil”.

Define a “randomIntArray” method.

This function generates random number for sorting

Define a “swap()” method.

This function swaps the two entries of an array.

MergeSorter.java:

Define the class “MergerSorter”.

Define a “sort()” method.

This sorts an array using merge sort.

Define a “merge()” method.

This function merge the two sorted arrays into an array.

HeapSorter.java:

Define a class “HeapSorter”.

Define a “sort()” method.

This function sorts the given array using selection sort.

Define a “fixHeap()” method.

This function confirms the heap property for a subtree.

Ensures that the children nodes fulfil the heap property.

Define a “getLeftChildIndex()” method.

This returns the left child of the subtree.

Define a “getRightChildIndex()” method.

This returns the right child of the subtree.

StopWatch.java:

Define a class “StopWatch”.

Define a constructor “StopWatch()”.

This generates the stopwatch in stopped state.

Define a “start()” function.

This starts the stopwatch.

Define a “stop()” function.

This stops the stopwatch and add this time to elapsed time.

Define a “getElapsedTime()”.

This returns the total elapsed time.

Define a “reset()” function.

This resets the elapsed time to 0 and “isRunnning” to false.

SorterTimer.java:

Define the class “SorterTimer”.

○ Define the “main()”.

Create Scanner object as “in”.

Read the input from the user for array size.

Generate a random array using “ArrayUtil” class.

Create an object for “StopWatch” as “timer”.

Call the “Stopwatch” member function “start()”.

Next call the “sort()” function from MergeSorter. Then stop the stopwatch using “stop()” function.

Print the value of time taken by merge sort.

Create an object for “StopWatch” as “timer”.

Call the “Stopwatch” member function “start()”.

Next call the “sort()” function from “HeapSorter”. Then stop the stopwatch using “stop()” function.

Print the value of time taken by heap sort.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

What should the next three steps be in my machine based home security system after deployment and after the following current steps: Enhancing Security & Privacy Measures User Interface (UI) and Experience (UX) Improvement Machine Learning Model Refinement & Continuous Improvement

I am creating a machine learning home based security system, have completed initial deployment and in the following phases of the project: Expanding device compatibility and integration, preparing for cloud integration, and implementing system reduncancy and disaster recovery. What should the next three phases be?

Hands-On Assignments Part II Assignment 1-5: Querying the DoGood Donor Database Review the DoGood Donor data by writing and running SQL statements to perform the following tasks: 1. List each donor who has made a pledge and indicated a single lump sum payment. Include first name, last name, pledge date, and pledge amount. 2. List each donor who has made a pledge and indicated monthly payments over one year. Include first name, last name, pledge date, and pledge amount. Also, display the monthly payment amount. (Equal monthly payments are made for all pledges paid in monthly payments.) 3. Display an unduplicated list of projects (ID and name) that have pledges committed. Don't display all projects defined; list only those that have pledges assigned. 4. Display the number of pledges made by each donor. Include the donor ID, first name, last name, and number of pledges. 5. Display all pledges made before March 8, 2012. Include all column data from the DD PLEDGE table.