public static void main(String [] args){
		
		Insertion insert = new Insertion();
		Scanner input = new Scanner(System.in);
		
		int numbers;
		System.out.print("How many numbers do you want in an array: ");
		numbers = input.nextInt();
		int[] array = new int[numbers];
		
		int low = 0, high = array.length - 1, mid = (low+high)/2,num = 0, target = 0; 
		
		for(int i = 0; i < array.length; i++)
		{
			System.out.println("Enter a number "+"["+i+"]"+": ");
			num = input.nextInt();
			array[i] = num;
		}
		
		insert.insertion_srt(array, array.length);
		
		System.out.println("Your numbers sorted: ");
		
		for(int a = 0; a < array.length; a++) 
						{System.out.print(array[a]+" ");}
			
		System.out.println("\nWhich number do you want to look for?: ");
			target = input.nextInt();
	
		/*while 0 is less than or equal to the last element in the array
		 * and the middle number is not equal to the target number
		 * then perform the if and else statement. Which states that if your target
		 * number is greater than the middle number, then set the lowest element to the right side of 
		 * the array or if your target number is less than the middle number,
		 * set the highest element in the array to the highest left side of the array. 
		 * At this point you must redefine mid.
		 * If the element you are looking for is outside the array, then set the middle
		 * number = to -1, which symbolizes that the number is not in the array. */
		
		while(low<=high && array[mid] != target)
		{	
			if (target > array[mid]) 
						{low  = mid + 1;}	
			else if(target < array[mid])					 
						{high = mid - 1;}
			else
						{System.out.println("Your number was found!: "+array[mid]+" At Index of: "+mid);}
			
			mid = (low+high)/2;
		}
		
		if (low>high)
						{System.out.println("Your number was not found! ");}
				
		else if (array[mid] == target)
						{System.out.println("Your number was found!: \""+array[mid]+"\" At Index of: "+mid);}
		
		else
						{System.out.println("I don't recognize what was done. ");}
		
		input.close();	
	}