BinarySearchIterative

package com.company;

/*
* Given an array of integers nums which is sorted in ascending order,
* and an integer target, write a function to search target in nums.
* If target exists, then return its index. Otherwise, return -1.
* You must write an algorithm with O(log n) runtime complexity.
 */
public class Main {
    public static int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;

        while (left <= right){
            int index = (left + right)/2;
            if (nums[index] == target)
                return index;
            if (nums[index] > target)
                right = index - 1;
            else
                left = index + 1;
        }
        return -1;
    }

    public static void main(String[] args) {
        int array[] = {-1,0,3,5,9,12};
        System.out.println(search(array,2));
    }
}