Z6_ArrayMergeSort

/**
 * @author Novo
 *
 */
public class Z6_ArraySort {

    public static void main(String[] args) {

        int[] niz1 = { 4, 2, 5, 6, 3, 1, };
        int[] niz2 = { 7, 35, 6, 5, 43, 10, 8, };

        print(sortArray(mergeArray(niz1, niz2)));
    }


    public static int[] mergeArray(int[] niz1, int[] niz2) {
        int[] arr = new int[niz1.length + niz2.length];

        // kopiranje niz1 u niz3
        for (int i = 0; i < niz1.length; i++) {
            arr[i] = niz1[i];
        }

        // kopiranje niz2 u niz3
        for (int i = 0; i < niz2.length; i++) {
            arr[niz1.length + i] = niz2[i];
        }

        return arr;
    }

    public static int[] sortArray(int[] arr){
        for (int i = 0; i < arr.length; i++) {
            int temp;
            for (int j = 0; j < arr.length; j++) {
                if (arr[i] < arr[j]) {
                    temp = arr[j];
                    arr[j] = arr[i];
                    arr[i] = temp;
                }
            }
        }
        return arr;

    }

    public static void print(int[] niz) {
        System.out.println("Sorted array: ");
        for (int i : niz) {
            System.out.print(i + " ");
        }
    }

}