Assume radix sorting of 1024 floats on a 32-bit machine with 8 passes (rounds). The floats...

 

Transcribed Image Text:

Assume radix sorting of 1024 floats on a 32-bit machine with 8 passes (rounds). The floats are initially stored in Ist[1024] and the sorted floats will be available in 1st at the end of sorting. float buf[1024] is available as working space. 1. What is the number of buckets? 2. The bit mask in hexadecimal is? 3. Find the number of data assignments for correcting the result when completed. For example, moving Ist[i] to buf[j], or buf[j]=lst[i]; is a data assignment. Assume radix sorting of 1024 floats on a 32-bit machine with 8 passes (rounds). The floats are initially stored in Ist[1024] and the sorted floats will be available in 1st at the end of sorting. float buf[1024] is available as working space. 1. What is the number of buckets? 2. The bit mask in hexadecimal is? 3. Find the number of data assignments for correcting the result when completed. For example, moving Ist[i] to buf[j], or buf[j]=lst[i]; is a data assignment.

Answer rating: 100% (QA)

Lets address your questions Number of Buckets Radix sort typically uses a bucket for each possible v... View the full answer