Алгоритми - Тема 09

import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;

import org.apache.commons.lang3.ArrayUtils;
//to work you need to download apache commons
//go to http://commons.apache.org/proper/commons-lang/download_lang.cgi and download commons-lang3-3.11-bin.zip
//then Right click in your project then: Project Properties > Java Build Path > Library > add External JARS
//select commons-logging-1.2.jar and commons-logging-1.2-javadoc.jar from your downloaded unzip commons-logging-1.2-bin.zip

public class Tema09 {

     public static void main(String[] args) {
            Scanner scan = new Scanner(System.in);
            System.out.print("Enter how many numbers to be sorted: ");
            int n = scan.nextInt();
            int[] arr = new int[n];
            int[] even = new int[arr.length];
            int[] odd = new int[arr.length];

            for (int i = 0; i < n; i++) { //inserting numbers into arr
                System.out.printf("Please input number <%d>: ", i);
                int number = scan.nextInt();
                arr[i] += number;
            }


            for (int i = 0; i < arr.length; i++) { //separating arr into even and odd
                if (arr[i] % 2 == 0) {
                    even[i] += arr[i];
                } else {
                    odd[i] += arr[i];
                }
            }


            for (int i = 0; i < even.length - 1; i++) { //BubbleSort for even
                for (int j = 0; j < even.length - i - 1; j++) {
                    if (even[j] > even[j + 1]) {
                        int swap = even[j];
                        even[j] = even[j + 1];
                        even[j + 1] = swap;
                    }
                }
            }

            for (int i = 0; i < even.length; i++) { //removing 0's from even array
                if (even[i] == 0) {
                    even = ArrayUtils.remove(even, i);
                    i--;
                }
            }
            System.out.println("Numbers after BubbleSort:");
            System.out.println(Arrays.toString(even)); //printing even(numbers are duplicated if they are repeated)

            for (int i = 1; i < odd.length; ++i) { //InsertionSort for odd
                int test = odd[i];
                int j = i - 1;
                while (j >= 0 && odd[j] > test) {
                    odd[j + 1] = odd[j];
                    j = j - 1;
                }
                odd[j + 1] = test;
            }

            for (int i = 0; i < odd.length; i++) { //removing 0's from odd array
                if (odd[i] == 0) {
                    odd = ArrayUtils.remove(odd, i);
                    i--;
                }
            }
            System.out.println("Numbers after InsertionSort:");
            System.out.println(Arrays.toString(odd)); //printing odd(numbers are duplicated if they are repeated)
        }

    }