数据结构-排序

package com.paixu;

import java.util.Arrays;

public class Main {

    public static void main(String[] args) {

        int[] arr={110,2,23,4,65,6,17,8,9,10,11,21,53,24,35,16};
        System.out.println(Arrays.toString(sort(arr)));
        System.out.println(Arrays.toString(sort2(arr)));
    }

    /**
     * 冒泡排序法
     * @param arr
     * @return
     */
    public static int[] sort(int[] arr){

        for (int i = 0; i <arr.length-1 ; i++) {
            for (int j = arr.length-1; j > i ; j--) {
                if (arr[j-1]>arr[j]){
                    int tmp=arr[j-1];
                    arr[j-1]=arr[j];
                    arr[j]=tmp;
                }
            }
        }
        return arr;
    }

    /**
     * 改进的冒泡排序法
     * @param arr
     * @return
     */
    public static int[] sort2(int[] arr){

        boolean flag=true;
        for (int i = 0; i <arr.length-1 && flag ; i++) {
            flag=false;
            for (int j = arr.length-1; j > i ; j--) {
                if (arr[j-1]>arr[j]){
                    int tmp=arr[j-1];
                    arr[j-1]=arr[j];
                    arr[j]=tmp;
                    flag=true;
                }
            }
        }
        return arr;
    }
}

package com.chazhao;

import java.util.Arrays;

public class Main3 {

    public static void main(String[] args) {

        int[] arr={110,2,23,4,65,6,17,8,9,10,11,21,53,24,35,16};
        System.out.println(Arrays.toString(sort(arr)));
    }

    /**
     * 选择排序
     * @param arr
     * @return
     */
    public static int[] sort(int[] arr){

        int currentMin;
        for (int i = 0; i < arr.length; i++) {
            currentMin=arr[i];
            for (int j = i+1; j < arr.length; j++) {
                if (currentMin > arr[j]){
                   arr[i]=arr[j];
                   arr[j]=currentMin;
                   currentMin=arr[i];
                }
            }
        }
        return arr;
    }
}