Ascending Order

#include <iostream.h>
 #include <iomanip.h>
 int main()
 {
 const int arraySize = 10;
 int a[ arraySize ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 };
 int i, hold;
 cout << "Data items in original order\n";
 for ( i = 0; i < arraySize; i++ )
 cout << setw( 4 ) << a[ i ];
 for ( int pass = 0; pass < arraySize - 1; pass++ ) 
 for ( i = 0; i < arraySize - 1; i++ ) 
 if ( a[ i ] > a[ i + 1 ] ) { 
 hold = a[ i ]; 
 a[ i ] = a[ i + 1 ];
 a[ i + 1 ] = hold;
 }
 cout << "\nData items in ascending order\n";
 for ( i = 0; i < arraySize; i++ )
 cout << setw( 4 ) << a[ i ];
 cout << endl;
 return 0;
 }

OUTPUT:

       Data items in original order
       2 6 4 8 10 12 89 68 45 37
       Data items in ascending order
       2 4 6 8 10 12 37 45 68 89


No comments:

Post a Comment