package basic;

/**
 * Created by ozc on 2018/3/16.
 *
 * @author ozc
 * @version 1.0
 */
public class Recursion {

    public static void main(String[] args) {

        int[] arrays = {1, 1, 2, 3, 5, 8, 13, 21};
        //bubbleSort(arrays, 0, arrays.length - 1);

        //int fibonacci = fibonacci(10);
        System.out.println("Java3y--------------------------------------------------" );
        hanoi(3, 'A', 'B', 'C');

        System.out.println("Java3y--------------------------------------------------" );


    }

    /**
     * 
     * @param n n
     * @param start 
     * @param transfer 
     * @param target 
     */
    public static void hanoi(int n, char start, char transfer, char target) {


        //
        if (n == 1) {
            System.out.println(start + "---->" + target);
        } else {

            //()
            hanoi(n - 1, start, target, transfer);
            System.out.println(start + "---->" + target);

            //
            hanoi(n - 1, transfer, start, target);

        }
    }


    /**
     * 
     * @param n
     * @return
     */
    public static int fibonacci(int n) {
        if (n == 1) {
            return 1;
        } else if (n == 2) {
            return 1;
        } else {
            return (fibonacci(n - 1) + fibonacci(n - 2));
        }

    }


    public static void bubbleSort(int[] arrays, int L, int R) {

        int temp;

        //
        if (L == R) ;

        else {
            for (int i = L; i < R; i++) {
                if (arrays[i] > arrays[i + 1]) {
                    temp = arrays[i];
                    arrays[i] = arrays[i + 1];
                    arrays[i + 1] = temp;
                }
            }

            //

            //""
            bubbleSort(arrays, L, R - 1);

        }
    }


    /**
     * 
     *
     * @param arrays 
     * @param L      
     * @param R      
     * @return
     */

    public static int findMax(int[] arrays, int L, int R) {

        //
        if (L == R) {
            return arrays[L];
        } else {

            int a = arrays[L];
            int b = findMax(arrays, L + 1, R);//


            if (a > b) {
                return a;
            } else {
                return b;
            }
        }

    }

    /**
     * 1+2+3+4+....+100(n)
     *
     * @param n 100
     * @return
     */
    public static int sum(int n) {

        if (n == 1) {
            return 1;
        } else {
            return sum(n - 1) + n;
        }
    }


}