排序之选择排序

View Code

 1 #include <stdio.h>

 2 #define OK 1

 3 int SelectSort(int *a,int length);

 4 int main()

 5 {

 6     int a[8] = {5,7,52,87,64,61,2,38};

 7     SelectSort(a,8);

 8     for(int i = 0;i < 8;i++)

 9     {

10         printf("%d ",a[i]);

11     }

12     printf("\n");

13     return 0;

14 }

15 

16 int SelectSort(int *a,int length)

17 {

18     int min = 0;

19     int temp;

20     for(int i = 0;i < length - 1;i++)

21     {

22         min = i;

23         for(int j = i + 1;j < length;j++)

24         {

25             if(a[j] < a[min]) min = j;        

26         }    

27         temp = a[i];

28         a[i] = a[min];

29         a[min] = temp;

30     }

31     return OK;

32 }