- Back to Home »
- ALGORITHM ANALYSIS »
- Selection sort algorithm implementation in c
Posted by : ANIMESH SHAW
Sunday, 2 October 2011
#include<stdio.h> main() { int array[100], n, c, d, swap; printf("Enter number of elements\n"); scanf("%d", &n); printf("Enter %d integers\n", n); for ( c = 0 ; c < n ; c++ ) scanf("%d", &array[c]); for ( c = 0 ; c < ( n - 1) ; c++ ) { for ( d = ( c + 1 ) ; d <= ( n - 1 ) ; d++ ) { if ( array[c] > array[d] ) { swap = array[c]; array[c] = array[d]; array[d] = swap; } } } printf("Sorted list in ascending order:\n"); for ( c = 0 ; c < n ; c++ ) printf("%d\n", array[c]); return 0; }

Post a Comment