/**
 * Sorts the array
 *
 * @Laura
 * @1.0
 */

import java.util.*;

public class Sort
{
    public Sort() {
        int[] primeArr = generatePrimes();
        System.out.println("Original Array: " + Arrays.toString(primeArr));
        System.out.println("Sorted Array: " + Arrays.toString(insertionSort(primeArr)));
    }
    public int[] insertionSort(int[] a) {
        for (int i = 0; i < a.length-1; i++) {
            while (a[i+1] < a[i]) {
                int temp = a[i];
                a[i] = a[i+1];
                a[i+1] = temp;
                if (i >= 1) {
                    i -= 1;
                }
            }
        }
        return a;
    }
    public boolean isPrime(int y) {
        for (int i = 2; i < y/2; i++) {
            if (y % i == 0) {
                return false;
            }
        }
        return true;
    }
    public int[] generatePrimes() {
        int[] primes = new int[10];
        int count = 0;

        while (count < 10) {
            int rand = (int)(Math.random() * 200 + 1);
            if (isPrime(rand)) {
                primes[count] = rand;
                count++;
            }
        }
        return primes;
    }
}