Answers for "binary search what is"

binary search easiest way

int binsearch(int lo, int hi)
{
	while(lo < hi)
	{
		int mid = lo + (hi-lo)/2;
		if(check(mid))
			hi = mid;
		else
			lo = mid + 1;
	}
	return lo;
}

Binary Search

def binary_search(arr, x):
    low = 0
    high = len(arr) - 1
    mid = 0
 
    while low <= high:
 
        mid = (high + low) // 2
 
        // If x is greater, ignore left half
        if arr[mid] < x:
            low = mid + 1
 
        // If x is smaller, ignore right half
        elif arr[mid] > x:
            high = mid - 1
 
        // means x is present at mid
        else:
            return mid
 
    // If we reach here, then the element was not present
    return -1
 
 
// Test array
arr = [ 2, 3, 4, 10, 40 ]
x = 10
 
// Function call
result = binary_search(arr, x)
 
if result != -1:
    print("Element is present at index", str(result))
else:
    print("Element is not present in array")

Binary Search

class BinarySearchExample{  
 public static void binarySearch(int arr[], int first, int last, int key){  
   int mid = (first + last)/2;  
   while( first <= last ){  
      if ( arr[mid] < key ){  
        first = mid + 1;     
      }else if ( arr[mid] == key ){  
        System.out.println("Element is found at index: " + mid);  
        break;  
      }else{  
         last = mid - 1;  
      }  
      mid = (first + last)/2;  
   }  
   if ( first > last ){  
      System.out.println("Element is not found!");  
   }  
 }  
 public static void main(String args[]){  
        int arr[] = {10,20,30,40,50};  
        int key = 50;  
        int last=arr.length-1;  
        binarySearch(arr,0,last,key);     
 }  
}