java选择排序实现

public class SelectionSort{public static void main(String [] args){long [] arr = {23 , 45 , 6 , 56 , 8,10,-980,-10,33,44};sort(arr);show(arr);}public static void show(long [] arr){for(long val : arr){System.out.print(val+"\t");}System.out.print("\n");}public static void sort(long [] arr){int minIndex = 0;long temp = 0;for(int i = 0; i< arr.length - 1; i++){minIndex = i;for(int j = i;j<arr.length;j++){if(arr[j] < arr[minIndex]){// j index data is ltminIndex = j;}}temp = arr[i];arr[i] = arr[minIndex];arr[minIndex] = temp;}}}

与冒泡排序相比 较少了 交互数据的次数