#include <iostream.h>
#include <iomanip.h>
\n
\/\/ constant size must be defined as the array size for bucketSort to work<\/FONT> void bucketSort( int [] ); int main() cout << “Array elements in original order:n”;<\/P> for ( int i = 0; i < SIZE; ++i ) cout << ‘n’; cout << “nArray elements in sorted order:n”;<\/P> for ( int j = 0; j < SIZE; ++j ) cout << endl; \/\/ Perform the bucket sort algorithm totalDigits = numberOfDigits( a, SIZE );<\/P> for ( int i = 1; i <= totalDigits; ++i ) { if ( i != totalDigits ) \/\/ Determine the number of digits in the largest number for ( int i = 1; i < arraySize; ++i ) while ( largest != 0 ) { return digits; \/\/ Distribute elements into buckets based on specified digit<\/FONT> for ( int i = 1; i < digit; ++i ) \/\/ determine the divisor for ( int k = 0; k < SIZE; ++k ) { \/\/ retrieve value in buckets[bucketNumber][0] to determine \/\/ Return elements to original array for ( int i = 0; i < 10; ++i ) \/\/ Set all buckets to zero #include <iostream.h>#include < … \u7ee7\u7eed\u9605\u8bfb
const int SIZE = 12;<\/P>
\n
void distributeElements( int [], int [][ SIZE ], int );
void collectElements( int [], int [][ SIZE ] );
int numberOfDigits( int [], int );
void zeroBucket( int [][ SIZE ] );<\/P>
\n
{
int array[ SIZE ] = { 19, 13, 5, 27, 1, 26, 31, 16, 2, 9, 11, 21 };<\/P>
\n
\n
cout << setw( 3 ) << array[ i ];<\/P>
\n
bucketSort( array );<\/P>
\n
\n
cout << setw( 3 ) << array[ j ];<\/P>
\n
return 0;
}<\/P>
\n
<\/FONT>void bucketSort( int a[] )
{
int totalDigits, bucket[ 10 ][ SIZE ] = { 0 };<\/P>
\n
\n
distributeElements( a, bucket, i );
collectElements( a, bucket );<\/P>
\n
zeroBucket( bucket ); \/\/ set all bucket contents to zero
}
}<\/P>
\n
int numberOfDigits( int b[], int arraySize )
{
int largest = b[ 0 ], digits = 0;<\/P>
\n
if ( b[ i ] > largest )
largest = b[ i ];<\/P>
\n
++digits;
largest \/= 10;
}<\/P>
\n
}<\/P>
\n
void distributeElements( int a[], int buckets[][ SIZE ], int digit )
{
int divisor = 10, bucketNumber, elementNumber;<\/P>
\n
divisor *= 10; \/\/ used to get specific digit<\/P>
\n
\/\/ bucketNumber example for hundreds digit:
\/\/ (1234 % 1000 – 1234 % 100) \/ 100 –> 2<\/FONT><\/FONT>
bucketNumber = ( a[ k ] % divisor – a[ k ] %
( divisor \/ 10 ) ) \/ ( divisor \/ 10 );<\/P>
\n
\/\/ which element of the row to store a[i] in.<\/FONT>
elementNumber = ++buckets[ bucketNumber ][ 0 ];
buckets[ bucketNumber ][ elementNumber ] = a[ k ];
}
}<\/P>
\n
void collectElements( int a[], int buckets[][ SIZE ])
{
int subscript = 0;<\/P>
\n
for ( int j = 1; j <= buckets[ i ][ 0 ]; ++j )
a[ subscript++ ] = buckets[ i ][ j ];
}<\/P>
\n
void zeroBucket( int buckets[][ SIZE ] )
{
for ( int i = 0; i < 10; ++i )
for ( int j = 0; j < SIZE; ++j )
buckets[ i ][ j ] = 0;
}<\/P><\/p>\n","protected":false},"excerpt":{"rendered":"