diff --git a/DSA Essentials Solutions/Divide and Conquer/BinarySearchUsingRecursion.cpp b/DSA Essentials Solutions/Divide and Conquer/BinarySearchUsingRecursion.cpp
index ddc5b59..9ad0e87 100644
--- a/DSA Essentials Solutions/Divide and Conquer/BinarySearchUsingRecursion.cpp	
+++ b/DSA Essentials Solutions/Divide and Conquer/BinarySearchUsingRecursion.cpp	
@@ -3,9 +3,7 @@
 #include <bits/stdc++.h>
 using namespace std;
   
-#include <bits/stdc++.h>
-using namespace std;
-  
+
 // A recursive binary search function. It returns
 // location of x in given array arr[l..r] is present,
 // otherwise -1
@@ -41,4 +39,4 @@ int binarySearch(vector<int> v, int x)
     int n = v.size();
     int result = binary(v, 0, n - 1, x);
     return result;
-}
\ No newline at end of file
+}