选择排序C语言实现

1 #include<stdio.h>
  2 #include<stdlib.h>
  3
  4 typedef int item;
  5
  6 #define key(A) (A)
  7 #define less(A, B) (key(A) < key(B))
  8 #define exch(A, B) {item t = A; A = B; B = t;}
  9 #define compexch(A, B) if(less(B, A)) exch(A, B)
 10
 11
 12 void selection(item a[], int left, int right)
 13 {
 14     int i, j, min;
 15     for(i = left; i < right; i++)
 16     {
 17         min = i;
 18         for(j = i+1; j <= right; j++)
 19           if(less(a[j], a[min]))
 20             min = j;
 21         exch(a[i], a[min])
 22     }
 23 }