Sorting Benchmarks Program plan: Create the class “SortingBenchmarks”, Declare the required variables. Define the method “bubbleSort()”, Use “for” loop to sort the elements in the ascending order. Increment the count of bubble sort by 2 on each comparison and swaps on the elements. Return the count of bubble sort. Define the method “selectionSort()”, Use “for” loop to find the smallest value in the array and continue the process until the array becomes sorted. Increment the count of selection sort by 2 on each comparison and swaps on the elements. Return the count of selection sort. Define the method “insertionSort()”, Use “for” loop to insert the elements at the correct position and swap the elements based on comparisons. Increment the insertion sort by 1. Return the count of insertion sort. Define the method “quicksort()”, Call the method “doquicksort()” to sort the elements using the pivot value. Increment the quick sort by 1. Define the method “doquick_sort()”, Call the method “partition()” to partition the array values into two halves. Call the method “doquick_sort()” recursively to sort the left half of the values in the array. Call the method “doquick_sort()” recursively to sort the right half of the values in the array. Define the method “partition()”, Calculate the pivot value. Call the “swap()” method to swap the array values. Use “for” loop to scan the entire array and based on pivot value, call the “swap()” method to swap and arrange the values in order. Define the method “swap()”, Swap the values and increment the quick sort count by 2. Create the class “SortingBenchmarkTest”, Define the “main()” function, Use “for” loop to insert random of at least 20 integers for each sorting. Create the object for the “SortingBenhcmarkTest” class, Call the method “bubbleSort()” to sort the values in order. Call the method “selectionSort()” to sort the values in order. Call the method “insertionSort()” to sort the values in order. Call the method “quickSort()” to sort the values in order. Print the sorted elements of each sorting and then print the number of comparisons made by each sorting.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 8PC

Program Plan Intro

Sorting Benchmarks

Program plan:

Create the class “SortingBenchmarks”,

Declare the required variables.

Define the method “bubbleSort()”,

Use “for” loop to sort the elements in the ascending order.

Increment the count of bubble sort by 2 on each comparison and swaps on the elements.

Return the count of bubble sort.

Define the method “selectionSort()”,

Use “for” loop to find the smallest value in the array and continue the process until the array becomes sorted.

Increment the count of selection sort by 2 on each comparison and swaps on the elements.

Return the count of selection sort.

Define the method “insertionSort()”,

Use “for” loop to insert the elements at the correct position and swap the elements based on comparisons.

Increment the insertion sort by 1.

Return the count of insertion sort.

Define the method “quicksort()”,

Call the method “doquicksort()” to sort the elements using the pivot value.

Increment the quick sort by 1.

Define the method “doquick_sort()”,

Call the method “partition()” to partition the array values into two halves.

Call the method “doquick_sort()” recursively to sort the left half of the values in the array.

Call the method “doquick_sort()” recursively to sort the right half of the values in the array.

Define the method “partition()”,

Calculate the pivot value.

Call the “swap()” method to swap the array values.

Use “for” loop to scan the entire array and based on pivot value, call the “swap()” method to swap and arrange the values in order.

Define the method “swap()”,

Swap the values and increment the quick sort count by 2.

Create the class “SortingBenchmarkTest”,

Define the “main()” function,

Use “for” loop to insert random of at least 20 integers for each sorting.

Create the object for the “SortingBenhcmarkTest” class,

Call the method “bubbleSort()” to sort the values in order.

Call the method “selectionSort()” to sort the values in order.

Call the method “insertionSort()” to sort the values in order.

Call the method “quickSort()” to sort the values in order.

Print the sorted elements of each sorting and then print the number of comparisons made by each sorting.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Please do not use any AI tools to solve this question. I need a fully manual, step-by-step solution with clear explanations, as if it were done by a human tutor. No AI-generated responses, please.

Obtain the MUX design for the function F(X,Y,Z) = (0,3,4,7) using an off-the-shelf MUX with an active low strobe input (E).

I cannot program smart home automation rules from my device using a computer or phone, and I would like to know how to properly connect devices such as switches and sensors together ? Cisco Packet Tracer 1. Smart Home Automation:o Connect a temperature sensor and a fan to a home gateway.o Configure the home gateway so that the fan is activated when the temperature exceedsa set threshold (e.g., 30°C).2. WiFi Network Configuration:o Set up a wireless LAN with a unique SSID.o Enable WPA2 encryption to secure the WiFi network.o Implement MAC address filtering to allow only specific clients to connect.3. WLC Configuration:o Deploy at least two wireless access points connected to a Wireless LAN Controller(WLC).o Configure the WLC to manage the APs, broadcast the configured SSID, and applyconsistent security settings across all APs.