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

make corrections of this program based on the errors shown. this is CIS 227 .

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…