Tema09_InsertionSort_Odd&Even

import java.util.*;

//Denis 18110
public class Insertion {
    private int n;

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        System.out.println("Kolko elementa iskate da ima masiva?");
        int len = scan.nextInt();
        int arr[] = new int[len];
        System.out.println("Zapishete elementite.");
        for (int i = 0; i < len; i++) {
            arr[i] = scan.nextInt();
        }
        System.out.println("Nepodreden masiv: " + Arrays.toString(arr));
        System.out.println("Nechetni podredeni: " + Arrays.toString(Inserti(GetOdd(arr))));
        System.out.println("Chetni podredeni: " + Arrays.toString(bubble(GetEven(arr))));

    }

    public static int[] GetOdd(int[] arr) {
        int counter = 0;
        int index = 0;
        boolean created = false;
        for (int k : arr) { // drug vid za vurtene na loop kogato imame array
            if (k % 2 != 0) {//proverka za nechetno
                counter++;
            }
        }
        int[] arrodd = new int[counter];
        for (int j : arr) {
            if (j % 2 != 0) {
                arrodd[index] = j;
                index++;
            }
        }
        return arrodd;
    }

    public static int[] GetEven(int[] arr) {
        int counter = 0;
        int index = 0;
        boolean created = false;
        for (int k : arr) {
            if (k % 2 == 0) {//proverka za chetno
                counter++;
            }
        }
        int[] arrodd = new int[counter];
        for (int k : arr) {
            if (k % 2 == 0) {
                arrodd[index] = k;
                index++;
            }
        }
        return arrodd;
    }
    public static int[] bubble(int[] G){ //dobriq star bubble sort
        int n = G.length;
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < n - i - 1; j++) {
                if (G[j] > G[j + 1]) {
                    int temp = G[j];
                    G[j] = G[j + 1];
                    G[j + 1] = temp;
                }
            }
        }
        return  G;
    }
    public static int[] Inserti(int[] arrodd){
        for (int i = 1; i < arrodd.length; i++) { // sortirashtiq loop
            int key = arrodd[i];
            int j = i - 1;
            while (j >= 0 && arrodd[j] < key) { //proverqva prednoto chislo i dali e vuv masiva
                arrodd[j + 1] = arrodd[j];
                j = j - 1;
            }
            arrodd[j + 1] = key;
        }
        return arrodd;
    }

}