Answered step by step
Verified Expert Solution
Question
1 Approved Answer
in JAVA: Design a class named StopWatch. The class contains: Private data fields startTime and endTime with getter methods. A no-arg constructor that initializes startTime
in JAVA: Design a class named StopWatch. The class contains:
Private data fields startTime and endTime with getter methods.
A no-arg constructor that initializes startTime with the current time.
A method named start() that resets the startTime to the current time.
A method named stop() that sets the endTime to the current time.
A method named getElapsedTime() that returns the elapsed time for the stopwatch in milliseconds.
Write a test program that measures the execution time of sorting 100,000 numbers (generated randomly in the range of 0 to 100) using the following selection sort method:
/** The method for sorting the numbers */
public static void selectionSort(int[] list) {
for (int i = 0; i
// Find the minimum in the list[i..list.length-1]
int currentMin = list[i];
int currentMinIndex = i;
for (int j = i + 1; j
Objectives: In this lab, the following topic will be covered: 1. Objects and Classes . Task Design a class named StopWatch. The class contains: Private data fields startTime and end time with getter methods. A no-arg constructor that initializes startTime with the current time. A method named start that resets the start Time to the current time. A method named stop that sets the end Time to the current time. A method named getElapsed Timed that returns the elapsed time for the stopwatch in milliseconds Write a test program that measures the execution time of sorting 100,000 numbers (generated randomly in the range of 0 to 100) using the following selection sort method: . /** The method for sorting the numbers */ public static void selectionsort(int[list) { for (int i = 0; i list[5) { Surco Mia = list[5]; Surco Mintadex - j; > 3 // swap list[i] with distil.curcat Mintadex) if necessary; if (currentMioIndex != 1) { listisurcentMinIndex] list[i]; distil surcent Mind if (currentMin > list[j]) {
currentMin = list[j];
currentMinIndex = j;
}
}
// Swap list[i] with list[currentMinIndex] if necessary;
if (currentMinIndex != i) {
list[currentMinIndex] = list[i];
list[i] = currentMin;
}
}
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started