冒泡排序法

public class MainActivity extends AppCompatActivity {
    int[] arr = new int[]{9, 5, 4, 8, 7, 3, 1};
    protected void onCreate(Bundle savedInstanceState) {
        super.onCreate(savedInstanceState);
        setContentView(R.layout.activity_main);
        int[] maopao = maopao(arr);
        for (int a : maopao) {
            System.out.println(a);
        }

    }

    public int[] maopao(int[] array) {
        for (int f=0; f < array.length-1; f++) {//遍历所有的数
            for (int i=0; i < array.length - f-1; i++){//找最大的放后面
                if (array[i] > array[i + 1]) {
                    int temp = array[i + 1];
                    array[i + 1] = array[i];
                    array[i] = temp;
                }
            }
        }
        return array;
    }
}