I am having a little trouble understanding bucketsort.

What determines the number of buckets used? Is it the size of the given array or is it the range of numbers in the given array? Is it determined by the value we choose for n? Also, how do you know what value to chose for n when A. Again, is it a number larger than the range of numbers in the given array?

Also, can someone show me the bucketlist for [6,82,3,1123,7,4,4,5,3,2,7,1,8,4,332]

Thanks

4. (20%) Illustrate and show how to sort the array A = [6,8,3,1,7,4,4,5,3,2,7,1,8,4,3] using Counting sort and Bucket sort respectively. Answer: Since Bucket Sort divides the interval [0,1) before sorting. we need to process A array so that each element's value fall into [0,1) (Consider if A = [6.82.3, 1123.7.4.4.5.3.2,7, 1.8.4.332]?) A/10 = [0.6,0.8,03,0.10.7,0.4,0.4,0.5,03,0.20.7,0.10.8.0.4,0.3] all