알고리즘

이분탐색 java

개발자가되고싶어 2020. 7. 21. 10:47
public static void main(String[] args) {

        long[] room = {1,2,3,4,5};
        int find = 4; //내가 찾을값

        int pivot = 0;
        int left = 0;
        int right = room.length-1;
        while (room[pivot] != find) {
            pivot = (left+right) / 2;
            if(find > room[pivot]) {
                left = pivot+1;
            } else if(find < room[pivot]) {
                right = pivot-1;
            } else {
                //같은경우
                System.out.println(room[pivot]);
            }
        }
    }