BinarySearch, Java

Language: Layout:

//'main' method must be in a class 'Rextester'.
//Compiler version 1.8.0_111

import java.util.*;
import java.lang.*;

class Rextester
{  
  
	int arr[]={10,9,8,7,6,5,4,3,2,1};
	int n;
        Rextester(int a)
	{
		n=a;    //n is size of array
	}
	public boolean search(int a)
	{
		int mid,l,u,f=0;
 	  l=0;
 	  u=n-1;
           mid=(l+u)/2;
 	  while(l<=u)
 	  {
 		  if(arr[mid]==a)
                  { 
                    f=1;
                     break;
 		  }
 		  else
                  { 
                   if(arr[mid]<a)
                   {
 		        l=mid+1;
                   }
 		  else
                   {
 		       u=mid-1;
                   }
                 }
                  mid=(l+u)/2;
 	   }
                 if(f==1) 
                    return true;
                 else
 		    return false;
         }
 	public static void main(String args[])
 	{
 		int num;  //num is the number to be searched
 		Rextester obj=new Rextester(10);
 		num=7;
 		if(obj.search(num))
 		System.out.println("Number found");
 		else
 		System.out.println("Number not found");
 	}
}

[ + ] Show input
Compilation time: 0.63 sec, absolute running time: 0.14 sec, cpu time: 0.11 sec, memory peak: 18 Mb, absolute service time: 0,78 sec