排序算法

 1 #include <stdio.h>
 2 
 3 void bubble(int arr[], int length);
 4 void selectionSort (int arr[], int length);
 5 
 6 int main (void)
 7 {
 8     int arr[12] = {100, 23, 32, 1, 392, 13, 513, 123, 19, 251, 1, 52};
 9 
10     selectionSort(arr, 12);
11 
12     int i;
13     for(i = 0; i < 12; i++)
14     {
15         printf("%d: %d\n", i, arr[i]);
16     }
17 }
18 void bubble(int arr[], int length)
19 {
20     int i, j;
21     for(i = 0; i < length - 1; i++)
22     {
23         for(j = 0; j < length - 1 - i; j++)
24         {
25             if(arr[j] > arr[j + 1])
26             {
27                 int temp;
28                 temp = arr[j];
29                 arr[j] = arr[j + 1];
30                 arr[j + 1] = temp;
31             }
32         }
33     }
34 }
35 void selectionSort (int arr[], int length)
36 {
37     int i, j;
38     for(i = 0; i < length - 1; i++)
39     {
40         for(j = i + 1; j < length; j++)
41         {
42             if(arr[i] > arr[j])
43             {
44                 int temp;
45                 temp = arr[i];
46                 arr[i] = arr[j];
47                 arr[j] = temp;
48             }
49         }
50     }
51 }

 

转载于:https://www.cnblogs.com/itpoorman/p/3955487.html