diff --git a/java prog b/java prog
index 8cff89f..7372740 100644
--- a/java prog	
+++ b/java prog	
@@ -1,7 +1,6 @@
 import java.util.Scanner;
 
 // Binary Search in Java
-
 class Main {
   int binarySearch(int array[], int element, int low, int high) {
 
@@ -9,21 +8,21 @@ class Main {
     while (low <= high) {
 
       // get index of mid element
-      int mid = low + (high - low) / 2
+      int mid = low + (high - low) / 2;
 
       // if element to be searched is the mid element
       if (array[mid] == element)
-        return mid
+        return mid;
 
       // if element is less than mid element
       // search only the left side of mid
       if (array[mid] < element)
-        low = mid + 1
+        low = mid + 1;
 
       // if element is greater than mid element
       // search only the right side of mid
       else
-        high = mid - 1
+        high = mid - 1;
     }
 
     return -1;