public static void write_binarysort(int[] array, int searched){
        //int []sorted = new int[array.length];

        boolean found = false;
        int low = 0;
        int high = array.length-1;
        int curr = 0;

        while(low<=high){ //true now, becomes false // basically WHILE TRUE. DO>
            curr = (low + high) /2;
            if(array[curr] == searched){
                found = true;
            } else if(array[curr] < searched){
                low = curr + 1;
            }
            else {high = curr - 1;} //Look @ first half.

        }

        if(found){
            System.out.println("Found at postion: "+ curr);
        }else System.out.println("Not found. Insert before position: "+ curr); //<--- how/
        //return sorted;
    }