teko_test

package practices;

/**
 * @author Vinh
 *
 */

public class max_5th {

    public static void main(String[] args) {
        new max_5th();
    }

    public max_5th() {
        //list();
        System.out.println("Element max 5th in array");
        sort();

        //recur for max 5th in array
        //first: find max
        int max_arr = arr[0];
        for(int item: arr) {
            if(item > max_arr) {
                max_arr = item;
            }
        }
        //recur
        int max_5th = sortRecur(arr, 5, max_arr);
        System.out.println("sort2: " +max_5th);
        //
        InsertionSort();
        System.out.println("Anagram String");
        boolean F = isAnagram("bbaAawwB", "abwabwBA");
        System.out.println(F);
    }

    int n = 100;
    int[] arr = randomArrary(n);

    int[] randomArrary(int n) {
        int arr[] = new int[n];
        for(int i = 0 ; i < arr.length ; i++) {
            arr[i] = (int) Math.ceil(Math.random()*(n*10));
        }

        return arr;
    }

    void list() {
        for(int item: arr) {
            System.out.println(item);
        }
    }

    void sort() {
        int max1 = arr[0];
        int max2 = arr[0];
        int max3 = arr[0];
        int max4 = arr[0];
        int max5 = arr[0];

        for(int item: arr) {
            if(item > max1) {
                max1 = item;
            }
        }
        System.out.println("max1: " +max1);

        for(int item: arr) {
            if(item > max2 && item < max1) {
                max2 = item;
            }
        }
        System.out.println("max2: " +max2);

        for(int item: arr) {
            if(item > max3 && item < max2) {
                max3 = item;
            }
        }
        System.out.println("max3: " +max3);

        for(int item: arr) {
            if(item > max4 && item < max3) {
                max4 = item;
            }
        }
        System.out.println("max4: " +max4);

        for(int item: arr) {
            if(item > max5 && item < max4) {
                max5 = item;
            }
        }
        System.out.println("max5: " +max5);


    }



    /**
     * @param arr: an array to
     * @param n: max element in the order of n of array
     * @param max: max 1st of an array
     * @return max n-th element of the array
     */
    int sortRecur(int[] arr, int n, int max) {
        int max_return = arr[0];
        for(int item: arr) {
            if(item > max_return && item < max) {
                max_return = item;
            }
        }

        if( n -1 <= 1 ) {
            return max_return;
        }
        else {
            return sortRecur(arr, n-1, max_return);
        }

    }

    void InsertionSort() {
        for(int i = 0 ; i < arr.length ; i++) {
            int j = i - 1;
            int key = arr[i];
            while (j >= 0 && arr[j] > key) {
                arr[j+1] = arr[j];
                j--;
            }
            arr[j+1] = key;
        }
        System.out.println("sorted array");
        for(int i = n -1 ; i >= n-5 ; i--) {
            System.out.println(arr[i]);
        }
    }


    /**
     * @param s1: string s1
     * @param s2: string s2
     * @return true if s1, s2 is Anagram, false if isn't
     */
    boolean isAnagram(String s1, String s2) {
        if(s1.length() == s2.length()) {
            char[] s1_converted = toCharArray(s1);
            char[] s2_converted = toCharArray(s2);
            for(int i = 0 ; i < s1_converted.length ; i++) {
                if(s1_converted[i] != s2_converted[i]) {
                    return false;
                }
            }
        }
        else {
            return false;
        }


        return true;
    }

    /**
     * @param string s: string to convert and be ordered
     * @return array char: array of string ordered
     */
    char[] toCharArray(String s){
        char[] a = new char[s.length()];
        for(int i = 0 ; i < s.length() ; i++) {
            a[i] = s.charAt(i);
        }
        for(int i = 1 ; i < a.length ; i++) {
            int j = i -1;
            int key = a[i];
            while(j >= 0 && a[j] > key) {
                a[j+1] = a[j];
                j--;
            }
            a[j+1] =(char) key;
        }

        return a;
    }




}