/* Fig. 6.15: fig06_15.c This program sorts an array's values into ascending order */ #include #define SIZE 10 /* function main begins program execution */ int main() { /* initialize a */ int a[ SIZE ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 }; int pass; /* passes counter */ int i; /* comparisons counter */ int hold; /* temporary location used to swap array elements */ printf( "Data items in original order\n" ); /* output original array */ for ( i = 0; i < SIZE; i++ ) { printf( "%4d", a[ i ] ); } /* end for */ /* bubble sort */ /* loop to control number of passes */ for ( pass = 1; pass < SIZE; pass++ ) { /* loop to control number of comparisons per pass */ for ( i = 0; i < SIZE - 1; i++ ) { /* compare adjacent elements and swap them if first element is greater than second element */ if ( a[ i ] > a[ i + 1 ] ) { hold = a[ i ]; a[ i ] = a[ i + 1 ]; a[ i + 1 ] = hold; } /* end if */ } /* end inner for */ } /* end outer for */ printf( "\nData items in ascending order\n" ); /* output sorted array */ for ( i = 0; i < SIZE; i++ ) { printf( "%4d", a[ i ] ); } /* end for */ printf( "\n" ); return 0; /* indicates successful termination */ } /* end main */ /************************************************************************** * (C) Copyright 1992-2004 by Deitel & Associates, Inc. and * * Pearson Education, Inc. All Rights Reserved. * * * * DISCLAIMER: The authors and publisher of this book have used their * * best efforts in preparing the book. These efforts include the * * development, research, and testing of the theories and programs * * to determine their effectiveness. The authors and publisher make * * no warranty of any kind, expressed or implied, with regard to these * * programs or to the documentation contained in these books. The authors * * and publisher shall not be liable in any event for incidental or * * consequential damages in connection with, or arising out of, the * * furnishing, performance, or use of these programs. * *************************************************************************/