Term 2: Lesson 17 - Coding Activity

package random;

import java.util.ArrayList;

public class thing {

    public static void main(String[] args) {

         int[] array = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
            int search = 8;



            System.out.println(isSorted(array));
            System.out.println(binarySearch(array,search));





    }





    public static boolean isSorted(int [] a) {


        int flag = 0;

        for(int i =0; i < a.length-1;i++) {

            if(a[i+1] < a[i]) {

                flag = 1;

            }

        }

        if(flag == 1) {
            return false;
        }
        else {
            return true;
        }
    }


    public static int binarySearch(int [] a, int b) {

        int highest = a.length;
        int lowest = 0;
        int outside = -1;
        int middle = 0;

        while(outside == -1 && highest > lowest) {

            middle = (lowest + highest) / 2 ;

                if(a[middle] == b) {
                    outside = middle;
                }
                else if(b > middle) {
                    lowest = middle + 1;
                }
                else if(b < middle) {
                    highest = middle = -1;
                }


        }


        return outside;



    }




}