排序

 1 package Hzy;
 2 
 3 public class xuanze {
 4          public static void main(String[] args) { 
 5         int[] arr={1,3,2,45,65,33,12}; 
 6         System.out.println("交换之前：");
 7         for(int num:arr){ 
 8         System.out.print(num+" "); 
 9         } 
10         for(
11         int i = 0; i < arr.length - 1; i++) {
12         int k = i; 
13         for(int j = k + 1; j < arr.length; j++){
14         if(arr[j] < arr[k]){  
15                  k = j; 
16                     } 
17                 } 
18         if(i != k){  
19         int temp = arr[i]; 
20                 arr[i] = arr[k]; 
21                 arr[k] = temp; 
22                 } 
23         } 
24 
25         System.out.println();
26         System.out.println("交换后："); 
27         for(int num:arr){
28         System.out.print(num+" "); 
29         } 
30         } 
31         }

 1 package dyl;
 2 
 3 public class maopao {
 4     public static void main(String[] args) 
 5     { int[] arr={12,45,23,67,56,34,99,123}; 
 6     System.out.println("排序前数组为："); 
 7     for(int num:arr)
 8     { 
 9     System.out.print(num+" "); 
10     } 
11     for(int i=0;i<arr.length-1;i++){
12     for(int j=0;j<arr.length-1-i;j++){
13     if(arr[j]>arr[j+1]){ 
14     int temp=arr[j]; 
15     arr[j]=arr[j+1]; 
16     arr[j+1]=temp; 
17     } 
18     } 
19     } 
20     System.out.println(); 
21     System.out.println("排序后的数组为："); 
22     for(int num:arr){ 
23     System.out.print(num+" "); 
24     } 
25     } 
26 }