算法和数据结构

1.用递归求1+2+3+…+n的和

public static int getSum(int n){
        if (n == 1) {
            return 1;
        }
        return n+getSum(n-1);
    }
f(1)=1
f(2)=1+2=f(1)+2
f(3)=1+2+3=f(2)+3
...
f(n)=1+2+3+...+n=f(n-1)+n

2.把一个有序的数组打乱输出

    @Test
    public void exec(){
        Integer[] arr = new Integer[]{1,2,3,4,5,6,7,8,9};
        Random random = new Random();
        int ranNum =0;
        for (int i = 0; i <arr.length ; i++) {
        //使用随机数来记录随机生成的下标
            ranNum = random.nextInt(arr.length);
            //随机下标和固定下标交换位置，这样就实现了打乱
            int temp = arr[ranNum];
            arr[ranNum] =arr[i];
            arr[i] = temp;
        }

        for (int i = 0; i <arr.length ; i++) {
            System.out.print(arr[i]+" ");
        }

    }