To implement radix sort algorithm Program plan: In the file “ ArrayUtil.java ”, import necessary package, and create a class “ ArrayUtil”, Create “Random” object. Define the method “randomIntArray()”to create an array filled with random values. Define the method “swap()” to swap two entries of an array. In the file “ StopWatch.java ”, create a class “ StopWatch”, Declare private variable. Define the constructor to construct a stopwatch that is in the stopped state and has no time accumulated. Define the method “start()” to start the stopwatch, and time starts accumulating now. Define the method “stop()” to stop the stopwatch, and time stops accumulating and is added to the elapsed time. Define the method “getElapsedTime()” to return the total elapsed time. Define the method “reset()” to stop the watch and resets the elapsed time to 0. In the file “ Radix.java ”, create a class “ Radix”, Define the method “sort()” to sort the array using radix sort. In the file “ RadixSortTimer.java”, import the package, and create a class “RadixSortTimer”, Define the method “main()”, Initialize the necessary variables. Create random array. Create an object for “StopWatch”. Call the method “start()” to start the timer. Call the method “sort()” to sort the array. Call the method “stop()” to stop. Check if the array is sorted, using the function “checkSorted()”, If it is true, print the elapsed time. Otherwise, print the error. Define the method “checkSorted()” to check whether the array is sorted.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 7PP

Program Plan Intro

To implement radix sort algorithm

Program plan:

In the file “ArrayUtil.java”, import necessary package, and create a class “ArrayUtil”,

Create “Random” object.

Define the method “randomIntArray()”to create an array filled with random values.

Define the method “swap()” to swap two entries of an array.

In the file “StopWatch.java”, create a class “StopWatch”,

Declare private variable.

Define the constructor to construct a stopwatch that is in the stopped state and has no time accumulated.

Define the method “start()” to start the stopwatch, and time starts accumulating now.

Define the method “stop()” to stop the stopwatch, and time stops accumulating and is added to the elapsed time.

Define the method “getElapsedTime()” to return the total elapsed time.

Define the method “reset()” to stop the watch and resets the elapsed time to 0.

In the file “Radix.java”, create a class “Radix”,

Define the method “sort()” to sort the array using radix sort.

In the file “RadixSortTimer.java”, import the package, and create a class “RadixSortTimer”,

Define the method “main()”,

Initialize the necessary variables.

Create random array.

Create an object for “StopWatch”.

Call the method “start()” to start the timer.

Call the method “sort()” to sort the array.

Call the method “stop()” to stop.

Check if the array is sorted, using the function “checkSorted()”,

If it is true, print the elapsed time.

Otherwise, print the error.

Define the method “checkSorted()” to check whether the array is sorted.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

how to read log logs

Discrete Mathematics for Computer Engineering