package selectionSort;
import java.util.*;
public class Process {

	public static void main(String[] args) {
		int [] nums= getNumbers();
		int [] sorted = sortNumbers(nums);
		searchNums(sorted);

	}

	public static int[] getNumbers() {
		Scanner kb = new Scanner(System.in);
		int [] nums = new int[10];
		int index =0;
		System.out.println("Please enter 10 numbers to be sorted");
			while(index<10) {
			System.out.print("(Number " +  (index+1) + "/10:)");
			int num = kb.nextInt();
			nums[index]= num;
			boolean unique = isUnique(nums,num,index);
				if(unique) {
					index++;
				}
				else {
					System.out.println("That number has already been entered. Please enter a unique number");
				}
			}
		return nums;
	}

	public static boolean isUnique(int[] nums, int num,int index) {
		boolean unique = true;
		for(int i=0;i<=index;i++) {
			for(int j=0;j<i;j++) {
				if(nums[i]==nums[j]) {
					unique = false;
				}
			}
		}
		return unique;
	}

	public static int[] sortNumbers(int [] nums) {
		for(int i=0;i<nums.length;i++) {
			int index = i;
			for(int j=i+1;j<nums.length;j++) {
				if(nums[j]<nums[index]) {
					index =j;
				}
			}
			int small = nums[index];
			nums[index] = nums[i];
			nums[i]=small;
		}
		System.out.println("Here is your sorted list of inputs: ");
		System.out.print(nums[0]);
		for(int k=1;k<nums.length;k++) {
			System.out.print(" , " + nums[k]);
		}
		return nums;
	}

	public static void searchNums(int [] nums) {
		Scanner kb = new Scanner(System.in);
		int low =0;
		int high= nums.length;
		System.out.print("\nPlease enter a number you would like to search for...");
		int flag = kb.nextInt();
			while(high>=low) {
			int middle = (low + high)/2;
				if(nums[middle]==flag) {
					System.out.println("Your number: " + flag + " was found at index position: " + middle);
					break;
				}
				if(flag>middle) {
					low = middle +1;
				}
				if(flag<middle) {
					high = middle -1;
				}
			}
	}
}