数据基础的三种排序方式,哈哈哈

public class Test {

    public static void main(String[] args) {
        
        int[] s = {1,8,6,9,4,7,3,4,3};
        /**
         * 冒泡排序
         */
        for (int i = 0; i < s.length-1; i++) {
            // 找出数组中最大的数字，排到最后  
            for (int j = 0; j < s.length-i-1; j++) {
                if(s[j] > s[j+1]){
                    int a = s[j];
                    s[j] = s[j+1];
                    s[j+1] = a;
                }
            }
        }
        
        /**
         * 插入排序
         */
        for(int i = 1;i<=s.length-1;i++ ){
            // 准备插入的元素temp
            int temp = s[i];
            // 从i-1依次向后比较
            int j =i-1;
            //大就向后移动
            while(j>=0 &&s[j]>temp){
                s[j+1] = s[j];
                j--;
            }
            //小就插入到该元素前面
            s[j+1] = temp;
        }
        
        /**
         * 选择排序
         */
        for (int i = 0; i < s.length; i++) {
            int k = i;
            //找出数组中最小的元素
            for (int j = i + 1; j <= s.length - 1; j++) {
                if (s[j] < s[k]) {
                    k = j;
                }
            }
            //将最小的元素交换到最前面
            if (k != i) {
                int temp = s[i];
                s[i] = s[k];
                s[k] = temp;
            }
        }
        
        
    }
}