boolean linear_search(int arr[],int key){

int N=arr.length;

for(int i=0;i<N;i++){

if(arr[i]==key)

return true;

}

return false;

}

Time Complexity - O(1) O(n/2) O(n)

boolean binary_search(int arr[],int left,int right) {

if(left<=right){

int mid=(left + right)/2;

if(mid==key)

return true;

if(key<mid)

return binary_search(arr,left,mid);

return binary_search(arr,mid+1,right);

}

return false;

}

binary_search(arr,0,arr.length-1);

Time Complexity - O(1) O(log n) O(log n)