ekdnam · JanitChawla · Oct 3, 2020 · Oct 3, 2020 · Oct 3, 2020 · Oct 3, 2020
diff --git a/Graph Theory/README.md b/Graph Theory/README.md
diff --git a/Graph Theory/test b/Graph Theory/test
diff --git a/Miscellaneous/Largest Prime Factor/test b/Miscellaneous/Largest Prime Factor/test
diff --git a/Miscellaneous/Largest Product of a series/test b/Miscellaneous/Largest Product of a series/test
diff --git a/Miscellaneous/Luhn's Algorithm/test b/Miscellaneous/Luhn's Algorithm/test
diff --git a/Miscellaneous/Palindrome Product/test b/Miscellaneous/Palindrome Product/test
diff --git a/Miscellaneous/test b/Miscellaneous/test
diff --git a/README.md b/README.md
@@ -2,7 +2,7 @@
 
 ![Algorithms](./images/algorithms.jpg)
 
-An attempt to aggregate all the various algorithms used in CS.
+An attempt to aggregate all the various algorithms in CS.
 
 ## What you will gain by contributing here?
 

diff --git a/Randomized Algorithms/Armstrong's Permutation/Permute_By_Cylic.cpp b/Randomized Algorithms/Armstrong's Permutation/Permute_By_Cylic.cpp
diff --git a/Randomized Algorithms/Armstrong's Permutation/test b/Randomized Algorithms/Armstrong's Permutation/test
diff --git a/Randomized Algorithms/Permute In Place/Permute_In_Place.cpp b/Randomized Algorithms/Permute In Place/Permute_In_Place.cpp
diff --git a/Randomized Algorithms/Permute In Place/Simple_Permute.exe b/Randomized Algorithms/Permute In Place/Simple_Permute.exe
diff --git a/Randomized Algorithms/Permute In Place/test b/Randomized Algorithms/Permute In Place/test
diff --git a/Randomized Algorithms/Permute Without Identity/Permute_Without_Identity.cpp b/Randomized Algorithms/Permute Without Identity/Permute_Without_Identity.cpp
diff --git a/Randomized Algorithms/Permute Without Identity/Permute_Without_Identity.exe b/Randomized Algorithms/Permute Without Identity/Permute_Without_Identity.exe
diff --git a/Randomized Algorithms/Permute Without Identity/test b/Randomized Algorithms/Permute Without Identity/test
diff --git a/Randomized Algorithms/test b/Randomized Algorithms/test
diff --git a/Searching/Binary Search/Binary_Search.cpp b/Searching/Binary Search/Binary_Search.cpp
diff --git a/Searching/Binary Search/Binary_Search.exe b/Searching/Binary Search/Binary_Search.exe
diff --git a/Searching/Binary Search/arrayio.cpp b/Searching/Binary Search/arrayio.cpp
diff --git a/Searching/Binary Search/arrayio.h b/Searching/Binary Search/arrayio.h
diff --git a/Searching/Binary Search/binarySearch.c b/Searching/Binary Search/binarySearch.c
@@ -0,0 +1,34 @@
+#include <stdio.h> 
+
+int binarySearch(int arr[], int left, int right, int x) 
+{ 
+    while (left <= right) { 
+        int mid = left + (right - l) / 2; 
+
+        if (arr[mid] > x) 
+            right = mid - 1;
+
+        if (arr[mid] < x) 
+            left = mid + 1; 
+
+        else
+            return mid;
+
+    } 
+
+    return -1; 
+} 
+
+int main(void) 
+{ 
+    int arr[] = { 2, 3, 4, 10, 40 }; 
+    int n = sizeof(arr) / sizeof(arr[0]); 
+    int x = 10; 
+    int result = binarySearch(arr, 0, n - 1, x); 
+    (result == -1) ? printf("Element is not present"
+                            " in array") 
+                   : printf("Element is present at "
+                            "index %d", 
+                            result); 
+    return 0; 
+} 
diff --git a/Searching/Binary Search/test b/Searching/Binary Search/test
diff --git a/Searching/Fibonacci Search/README.md b/Searching/Fibonacci Search/README.md
@@ -0,0 +1 @@
+