changes made

Author: Sruja10

binary_search.java

@@ -1,6 +1,6 @@
 class BinarySearchExample{  
  public static void binarySearch(int arr[], int first, int last, int key){  
-   int mid = (first + last)/2;  
+   int mid = first + (last-first)/2;  
    while( first <= last ){  
       if ( arr[mid] < key ){  
         first = mid + 1;