Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
bartleby

Concept explainers

Question
Book Icon
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.

Blurred answer
Students have asked these similar questions
Please show the code for the Tikz figure of the complex plane and the curve C. Also, mark all singularities of the integrand.
11. Go to the Webinars worksheet. DeShawn wants to determine the number of webinars the company can hold on Tuesdays and Thursdays to make the highest weekly profit without interfering with consultations, which are also scheduled for Tuesdays and Thursdays and use the same resources. Use Solver to find this information as follows: a. Use Total weekly profit as the objective cell in the Solver model, with the goal of determining the maximum value for that cell. b. Use the number of Tuesday and Thursday sessions for the five programs as the changing variable cells. c. Determine and enter the constraints based on the information provided in Table 3. d. Use Simplex LP as the solving method to find a global optimal solution. e. Save the Solver model below the Maximum weekly profit model label. f. Solve the model, keeping the Solver solution. Table 3: Solver Constraints Constraint Cell or Range Each webinar is scheduled at least once on Tuesday and once on Thursday B4:F5 Each Tuesday and…
Go to the Webinars DeShawn wants to determine the number of webinars the company can hold on Tuesdays and Thursdays to make the highest weekly profit without interfering with consultations, which are also scheduled for Tuesdays and Thursdays and use the same resources. Use Solver to find this information as follows: Use Total weekly profit as the objective cell in the Solver model, with the goal of determining the maximum value for that cell. Use the number of Tuesday and Thursday sessions for the five programs as the changing variable cells. Determine and enter the constraints based on the information provided in Table 3. Use Simplex LP as the solving method to find a global optimal solution. Save the Solver model below the Maximum weekly profit model label. Solve the model, keeping the Solver solution. Table 3: Solver Constraints   Constraint Cell or Range Each webinar is scheduled at least once on Tuesday and once on Thursday B4:F5 Each Tuesday and Thursday…

Chapter 16 Solutions

Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)

Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr