Binary search on array

Question

Vadim · Accepted Answer

public int bs(int[] arr, int val) {
    int left = 0, right = arr.length - 1;
    while(left <= right) {
        int mid = (right - left) / 2;
        if(arr[mid] == val) {
            return mid;
       else if(arr[mid] < val) {
           left = mid + 1;
       } else {
            right = mid - 1;
   }
   return -1;
}

Omar · Answer

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package checkpoint;

/**
 *
 * @author Omar
 */
public class BinarySearch 
{
    public static int search(int[] a, int first, int last, int key)
    {
        int result = 0;
        if(first > last)
        {
            System.out.println("The " + key + " is not found inside the array");
            result = -1;
        }
        else
        {
            int mid = (first + last) / 2;
            if(key == a[mid])
            {
                result = mid;
            }
            if(key  a[mid])
            {
                result = search(a, mid + 1, last, key);
            }
        }
        return result;
    }
    
}

Check Point Software Technologies

Check Point Software Technologies Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches