(Bucket Sort) A bucket sort begins with a one-dimensional array of positive integers to besorted, and a two-dimensional array of integers with rows subscripted from 0 to 9 and columns subscripted from 0 to n – 1, where n is the number of values in the array to be sorted. Each row of thetwo-dimensional array is referred to as a bucket. Write a function bucketSort that takes an integerarray and the array size as arguments.The algorithm is as follows:a) Loop through the one-dimensional array and place each of its values in a row of thebucket array based on its ones digit. For example, 97 is placed in row 7, 3 is placed inrow 3 and 100 is placed in row 0.b) Loop through the bucket array and copy the values back to the original array. The neworder of the above values in the one-dimensional array is 100, 3 and 97.c) Repeat this process for each subsequent digit position (tens, hundreds, thousands, andso on) and stop when the leftmost digit of the largest number has been processed
(Bucket Sort) A bucket sort begins with a one-dimensional array of positive integers to be
sorted, and a two-dimensional array of integers with rows subscripted from 0 to 9 and columns subscripted from 0 to n – 1, where n is the number of values in the array to be sorted. Each row of the
two-dimensional array is referred to as a bucket. Write a function bucketSort that takes an integer
array and the array size as arguments.
The
a) Loop through the one-dimensional array and place each of its values in a row of the
bucket array based on its ones digit. For example, 97 is placed in row 7, 3 is placed in
row 3 and 100 is placed in row 0.
b) Loop through the bucket array and copy the values back to the original array. The new
order of the above values in the one-dimensional array is 100, 3 and 97.
c) Repeat this process for each subsequent digit position (tens, hundreds, thousands, and
so on) and stop when the leftmost digit of the largest number has been processed
Step by step
Solved in 2 steps with 1 images
