排序算法（六） 选择排序

package study;public class SortNumberTest {           public static void main(String[] args) {        Test1();    }    public static void Test1(){        System.out.println("选择排序");    int[] numbers7={7,6,5,8,1,3,8,4,2,9};    selectSort(numbers7);    System.out.println("...................................");        }        //选择排序     public static void selectSort(int[] numbers) {    print(numbers);        for (int i = 0; i < numbers.length-1; i++) {               int k = i;               for(int j=i+1;j<numbers.length;j++){              if (numbers[j] > numbers[k]) {                    k = j;               }            }               if(k!=i){                swap(numbers,i,k);              }        print(numbers);        }       }         private static void swap(int[] numbers, int a, int b) {    int t = numbers[a];    numbers[a] = numbers[b];    numbers[b] = t;    }      private static void  print(int[] numbers){    for (int i = 0; i < numbers.length; i++) {           System.out.print(numbers[i]+" ");        }        System.out.println();    }    }