直接选择排序与反转排序

 1  //直接选择排序
 2                 int[] array = { 63, 4, 24, 1, 3, 15 };
 3                 int j; int t;
 4                 for(int i = 1; i < array.length; i++)
 5                 {
 6                     int n = 0;
 7                     for(j = 1; j <=  array.length - i; j++)        //当i等于5的时候还要有一次比较
 8                     {                                                                 //若j<array.length，则内部少一次循环
 9                         if(array[j] > array[n])
10                         {
11                             n = j;
12                         }
13                     }
14                     t = array[(array.length - i )];
15                     array[(array.length - i )] = array[n];
16                     array[n] = t;
17                 }
18                 for(int r : array)
19                 {
20                     System.out.print(r + " ");
21                 }
22         System.out.println();
23         
24         
25         //反转排序
26         int changdu = array.length/2; 
27         int q = 0;
28         for(int m = 0; m < changdu; m++)
29         {
30             q = array[(array.length - 1) - m];
31             array[(array.length - 1) - m] = array[m];
32             array[m] = q;
33         }
34         for(int e : array)
35         {
36             System.out.print(e + " ");
37         }