SORTING
Selection Sort main( ) { int a[ ] = { 17, 6, 13,12, 2 } ; int i, j, t ; for ( i = 0 ; i
Jan 18, 2018
Bubble Sort main( ) { int a[ ] = { 17, 6, 13, 12, 2 } ; int i, j, t ; for ( j = 0 ; j <= 3 ; j++ ) { for ( i = 0 ; i <= 3 ; i++ ) { if ( a[ i ] > a[ i + 1 ] ) { t =a[ i ] ; a[ i ] = a[ i + 1 ] ; a[ i + 1 ] = t ; } } } for ( i = 0 ; i <= 4 ; i++ ) printf ( ”%d”, a[ i ] ) ; } - j i i
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Selection Sort main( ) { int a[ ] = { 17, 6, 13,12, 2 } ; int i, j, t ; for ( i = 0 ; i
Related Documents
![Brian Mitchell (bmitchel@mcs.drexel.edu) - Drexel University MCS680-FCS 1 Running Time of Programs int MSTWeight(int graph[][], int size) { int i,j; int.](https://static.cupdf.com/doc/110x72/56649e7d5503460f94b809b4/brian-mitchell-bmitchelmcsdrexeledu-drexel-university-mcs680-fcs-1-running.jpg)
