Simple Exchange Sort Algorithm

[huangblue]

Simple Exchange Sort Algorithm

This algorithm assumes that you are sorting an array a of n elements. Step 1: Set i to 0. Step 2: Set j to i + 1. Step 3: If a[i] > a[j], exchange their values. Step 4: Set j to j + 1. If j < n, go to step 3. Step 5: Set i to i + 1. If i < n – 1, go to step 2. Step 6: a is now sorted in ascending order.

[huangblue]

// Program to sort an array of integers into ascending order

include

void sort (int a[], int n) { 　 int i, j, temp; 　 for ( i = 0; i < n - 1; ++i ) 　　 for ( j = i + 1; j < n; ++j ) 　　　 if ( a[i] > a[j] ) { 　　　　 temp = a[i]; 　　　　 a[i] = a[j]; 　　　　 a[j] = temp; 　　　 } }

int main (void) { 　 int i; 　 int array[16] = { 34, -5, 6, 0, 12, 100, 56, 22, 　 44, -3, -9, 12, 17, 22, 6, 11 }; 　 void sort (int a[], int n);

　 printf ("The array before the sort:\n"); 　 for ( i = 0; i < 16; ++i ) 　 printf ("%i ", array[i]); 　 sort (array, 16); 　 printf ("\n\nThe array after the sort:\n"); 　 for ( i = 0; i < 16; ++i ) 　　 printf ("%i ", array[i]); 　 printf ("\n"); 　 return 0; }

[huangblue]

The array before the sort: 34 -5 6 0 12 100 56 22 44 -3 -9 12 17 22 6 11

The array after the sort: -9 -5 -3 0 6 6 11 12 12 17 22 22 34 44 56 100

Process returned 0 (0x0) execution time : 0.019 s Press any key to continue.