diff --git a/Searching/Binary_Search_array.cpp b/Searching/Binary_Search_array.cpp
index 4b33c51..de4c212 100644
--- a/Searching/Binary_Search_array.cpp
+++ b/Searching/Binary_Search_array.cpp
@@ -5,12 +5,12 @@
 //Author: goyaldhara
 #include<bits/stdc++.h>
 using namespace std;
-int Binary_Search(int arr[],int start,int end,int key)
+int Binary_Search(int arr[],int first,int last,int key)
 {
     // This function will return 1 if the key is found in the array, else it will return 0;
     while(start<=end)
     {
-        int mid=(start)+(end-start)/2;
+        int mid=(first)+(last-first)/2;
         if(arr[mid] == key)
             return 1;
         if(arr[mid] < key)
@@ -32,4 +32,4 @@ int main()
     cout<<Binary_Search(arr,0,n-1,key)<<'\n';
 
 return 0;
-}
\ No newline at end of file
+}