day three

1.反转数组，冒泡排序

package com.primay.day3;

public class ReDemo {
    public static void main(String[] args) {
        int[] arr=new int[5];
        arr[0]=1;
        arr[1]=3;
        arr[2]=2;
        arr[3]=5;
        arr[4]=4;
        ReDemo reDemo = new ReDemo();
        int[] re=new int[arr.length];
        re= reDemo.re(arr);
        reDemo.lcu(re);
        System.out.println();
        System.out.println("-------------");
        reDemo.lcu(reDemo.sor(arr));
    }
    public void lcu(int[] x){
        for (int i : x) {
            System.out.print(i+" ");
        }
    }
    public int[] re(int[] x){
        int[] re=new int[x.length];
        for(int i=0, j=re.length-1;i<x.length;i++,j--){
            re[i]=x[j];
        }
        return re;
    }
    public int[] sor(int[] x){
        int temp=0;
        for(int j=0;j<x.length;j++) {
            for (int i = x.length-1; i>j; i--) {
                if (x[i] < x[i-1]) {
                    //swap(x[i],x[i-1]);
                    temp=x[i];
                    x[i]=x[i-1];
                    x[i-1]=temp;
                }
            }
        }
        return x;
    }
    //形参改变影响不到实参
    public static void swap(int x,int y){
        int temp=0;
        temp = x;
       x = y;
       y = temp;
    }
}

2.alt+insert快速创建方法

 

3.

4.