(Java学习笔记5.2)选择排序

--选择排序
public class SelectionSort {
public static void sort(long[] arr){
int k=0;
long tmp=0;
for(int i=0;i<arr.length-1;i++){
k=i;//令K指向最小的数
for(int j=i;j<arr.length;j++){
if(arr[j]<arr[k]){
k=j;
}
}
tmp=arr[i];
arr[i]=arr[k];
arr[k]=tmp;
}
}
}

public class TestSort {
public static void main(String[] args){
long[] arr=new long[5];
arr[0]=34;
arr[1]=23;
arr[2]=2;
arr[3]=22;

System.out.print("[");
for(long num:arr){
System.out.print(num+" ");
}
System.out.print("]");
System.out.println();
//[34 23 2 22 0]

SelectionSort.sort(arr);

//[0 22 2 23 34]
System.out.print("[");
for(long num:arr){
System.out.print(num+" ");
}
System.out.print("]");
System.out.println();
}
}