diff --git a/Competitive_Programming/Binary Search Problems/Binary Search Problem (Documentation).txt b/Competitive_Programming/Binary Search Problems/Binary Search Problem (Documentation).txt
new file mode 100644
index 0000000000..17c5eefec8
--- /dev/null
+++ b/Competitive_Programming/Binary Search Problems/Binary Search Problem (Documentation).txt	
@@ -0,0 +1,215 @@
+# BINARY SEARCH PROBLEMS
+
+Binary search is also known as half-interval search. It is a searching technique in a sorted array by repeatedly dividing search intervals in half. It is an efficient algorithm to find the element efficiently. Repeatedly check until the value is found or the interval is empty.
+
+
+
+
+## Steps To Implement Binary Search
+Let us assume there is an array A and an element x.
+We have to search throughout the array and we need to find element x inside the array.
+If not present print -1 or print the position of the array.
+
+### Approach: 
+1. Compare x with the middle element of array A.
+2. If x matches with the middle element, we return the mid index.
+3. Else If x is greater than the mid element, then x can only lie in the right half subarray after the mid element. So we recur for the right half.
+4. Else (x is smaller) recur for the left half.
+#### Note: To apply binary search array must be sorted.
+
+#### Code in C++:
+
+```c
+#include<iostream>
+using namespace std;
+
+int binary_search(int arr, int size, int target)
+{    int start = 0;
+     int end = size-1;
+     while(start<=end)
+     {   // Finding mid of the array
+         int mid = end+(start-end)/2;
+        
+         // Comparing the middle element with target
+         if(arr[mid] == target)
+         {   // if the middle element is equals to target return the mid index
+             return mid;
+         }
+
+         else if(arr[mid] > target)
+         {   // if target is smaller than the middle element, then target can only lie in the left
+             end = mid - 1;
+         }
+
+         else if(arr[mid] < target)
+         {   // if target is greater than the middle element, then target can only lie in the right
+             start = mid + 1;
+         }
+     }
+     # if the target is not inside the array then return -1
+     return -1;
+}
+
+
+int main()
+{  //Consider a sorted Array   
+   int arr[]={1,3,5,8,10};
+   int target=8;  
+
+   // Calculating size of array
+   int size=sizeOf(arr)/sizeOf(arr[0]);
+   
+   // Calling of binary_search function
+   int index = binary_search(arr, size, target);
+   cout<<index<<endl;
+   return 0;
+}
+```
+
+## Binary Search Problems
+### Question: 
+### Find the index of first 1 in a sorted array of 0’s and 1’s if 1 is not present in the array print -1
+
+
+##### Example:
+
+ a[ ]={0,0,1,1,1}
+
+Output: 3
+
+
+
+
+
+a[ ]={0,0,0,0,0}
+
+
+Output: -1
+
+
+
+```c
+#include<iostream>
+#include<bits/stdc++.h>
+using namespace std;
+
+int find_first_occur(int arr[] , int n)
+{
+    int start=0;
+    int end=n-1;
+    int ans =-1;
+    while(start<=end)
+    {   // Finding mid of the array   
+        int mid=(end+start)/2;
+
+        //if middle is 0 then 1 lies in right half as array is sorted
+        if(arr[mid] == 0)
+            start=mid+1;
+        
+        // if middle is 1 then it may be possible that there is 1 in left of it
+        // thus, find the occurance in left half 
+        else if(arr[mid] == 1)
+        {   // possible position that this is the first occurance
+            ans=mid;
+            // but still finding left of it
+            end=mid-1;
+        }    
+    }
+    // completion of the loop either gives us the first occurance if 1 present
+    // otherwise return the default value -1 which indicates that 1 is not present in array 
+    return ans;
+}
+
+
+int main(){
+    int arr[]={0,0,0,0,1,1,1};
+    int n=sizeof(arr)/sizeof(arr[0]);    //size of the array
+    int first=find_first_occur(arr,  n);
+    if(first!=-1)
+        cout<<first+1<<endl;    // gives the index of first occurence of 1
+    else    
+        cout<<first<<endl;  // 1 is not present in the array
+}
+```
+
+
+### Question: 
+### Find the frequency of the target element if present in the sorted array and if not present then print "Not Found"
+
+##### Example:
+
+ a[]={1,2,3,3,3,4}, 
+target= 3
+
+Output: 
+total occurence of given target is: 3
+
+a[]={1,2,3,3,3,4}, 
+target= 5
+
+Output: 
+
+Not Found
+
+
+
+
+
+```c
+#include<iostream>
+#include<bits/stdc++.h>
+
+using namespace std;
+
+
+int binary(int arr[], int size, int target, bool isleft)
+{   int ans=-1;
+    int start= 0;
+    int end=size-1;
+
+    while(start<=end)
+    {   // finding the mid of the array
+        int mid=(start+end)/2;
+
+        // if target is smaller than middle then traverse in left half
+        if(arr[mid]>target)
+            end=mid-1;
+
+        // if target is greater than middle then traverse in right half
+        else if(arr[mid]<target)
+            start=mid+1;
+
+        // if target is found then traverse to find first occurence in left and right side resp
+        else if((arr[mid]==target)){
+            ans=mid;
+            if(isleft)  end=mid-1;          //searching in left side of the array
+            else        start=mid+1;        // searching int the right side of the array
+            
+        }
+    }
+    return ans;
+}
+int main(){
+    int arr[]={1,2,4,6,6,6,10};
+    int n = sizeof(arr)/sizeof(arr[0]);
+
+    int left = binary(arr, n, 6, true);
+
+    // find right if and only if left is present
+    if(left!=-1)
+    {
+        int right=binary(arr, n, 6, false);
+        cout<<"total occurence of given target is :" <<(right -left)+1;
+
+    }
+    // if left is -1 it implies that element is not present in the array
+    else 
+        cout<<"Not found"<<endl;
+    
+
+}
+```
+
+## End Note
+Hope this documentation provided you some basic idea about binary search algorithm and how to solve questions using this approach.
+Binary search runs in logarithmic time in the worst case, making O(log n) comparisons, where n is the number of elements in the array.Binary search is faster than linear search except for small arrays. However, the array must be sorted first to be able to apply binary search. There are specialized data structures designed for fast searching, such as hash tables, that can be searched more efficiently than binary search. However, binary search can be used to solve a wider range of problems, such as finding the next-smallest or next-largest element in the array relative to the target even if it is absent from the array.