选择排序算法

 1 public class NumSort
 2 {
 3     public static void main (String [] args)
 4     {
 5         int[] a=new int[args.length];
 6         for (int i=0;i<args.length;i++)
 7         {
 8             a[i] =Integer.parseInt(args[i]);
 9         }
10         print(a);
11         SelectionSort(a);
12         print(a);
13     }
14         
15     private static void SelectionSort(int[] a)
16     {
17         for (int i=0;i<a.length;i++)
18         {
19             for (int j=i+1;j<a.length;j++)
20             {
21                 if(a[j]<a[i])
22                 {
23                     int temp=a[i];
24                     a[i]=a[j];
25                     a[j]=temp;
26         
28                 }
29             }
30         }
31         
32     }    
33     private static void print(int[] a)
34     {
35         for (int i=0;i<a.length;i++)
36         {
37             System.out.print(a[i] + " ");
38             
39         }
40         System.out.println();
41         
42     }
43     
44 }

转载于:https://www.cnblogs.com/wangfeihu/p/5750894.html