Binary Search – Recursive

import java.util.Scanner;

public class BinSearchRecur

{

    static void BinSearch(int x[],int low,int high,int key)

    {

        int mid;

        if(low<=high)

        {

            mid=(low+high)/2;

            if(x[mid]==key)

                System.out.println("Element found at "+mid);

            if(x[mid]<key)

                BinSearch(x,mid+1,high,key);

            else

                BinSearch(x,low,mid-1,key);

        }

    }

    public static void main(String[] args)

    {

        Scanner in=new Scanner(System.in);

        int x[]=new int[10];

        int KEY,n=10;

Binary Search – Simple

import java.util.Scanner;

class BinarySearch

{

    static int Binary_Search(int K[ ],int n,int KEY)

    {

        int low=1,high=n,mid;

        mid=(low+high)/2;

        while (high>=low)

        {

            if (K[mid]==KEY)

                return(mid);

            else

            {

                if(KEY>K[mid])

                    low=mid+1;

                else

                    high=mid-1;

                mid=(low+high)/2;

            }

        }

        return(-1);

    }

    public static void main(String args[ ])

    {

        int i,KEY,flag=0;

        int x[] = new int[25];