diff --git a/C/algorithms/searching/binary_search.c b/C/algorithms/searching/binary_search.c
index 0c69ed23..30379ea6 100644
--- a/C/algorithms/searching/binary_search.c
+++ b/C/algorithms/searching/binary_search.c
@@ -1,42 +1,82 @@
-/*
-* Algorithm: [Binary Search]
- * Description: [Binary search is an efficient algorithm used to find the position of a target value within a sorted array or list. It works on the principle of repeatedly dividing the search interval in half.]
- * Time Complexity :
- *     Best Case : O(1)  // when given array is already sorted.
- *     Average Case : O(log n) //when given array is in random order
- *     Worst Case : O(log n) // when given array is in reverse order
- * Space Complexity:
- *   Worst : 0(1)
- * Author: [Kaustubh Udavant]
+ /*
+ * Algorithm: Binary Search (Iterative and Recursive)
+ * Description: An efficient algorithm used to find the position of a target value within a sorted array.
+ * Time Complexity: O(log n)
+ * Space Complexity: O(1) for Iterative, O(log n) for Recursive stack space
+ * Author: ADIL AHMED
  */
 
 #include <stdio.h>
-#define SIZE 10
-int BinarySearch(int [],int);
-int main()
-{
-    int a[SIZE]={3,5,9,11,15,17,22,25,37,68},key,pos;
-    printf("Enter the Search Key\n");
-    scanf("%d",&key);
-    pos=BinarySearch(a,key);
-    if(pos==-1)
-    printf("The search key is not in the array\n");
-    else
-    printf("The search key %d is at location %d\n",key,pos);
-    return 0;    
+#include <stdlib.h>
+#include <string.h>
+
+/**
+ * Performs iterative binary search on a sorted array
+ *
+ * @param arr: Sorted array to process
+ * @param size: Size of the array
+ * @param target: Element to search for
+ * @return: Index of target element if found, otherwise -1
+ */
+int Binary_search_iterative(int arr[], int size, int target) {
+    // Input validation
+    if (arr == NULL || size <= 0) {
+        return -1;
+    }
+
+    int low = 0, high = size - 1;
+    while (low <= high) {
+        int mid = low + (high - low) / 2;
+        if (arr[mid] == target) return mid;
+        else if (arr[mid] > target) high = mid - 1;
+        else low = mid + 1;
+    }
+    return -1;
+}
+
+/**
+ * Performs recursive binary search helper on a sorted array
+ *
+ * @param arr: Sorted array to process
+ * @param target: Element to search for
+ * @param low: Lower bound index
+ * @param high: Upper bound index
+ * @return: Index of target element if found, otherwise -1
+ */
+int Binary_search_recursive(int arr[], int target, int low, int high) {
+    if (low <= high) {
+        int mid = low + (high - low) / 2;
+        if (arr[mid] == target) return mid;
+        else if (arr[mid] > target) return Binary_search_recursive(arr, target, low, mid - 1);
+        else return Binary_search_recursive(arr, target, mid + 1, high);
     }
+    return -1;
+}
+
+
+/**
+ * Test function to demonstrate the algorithm
+ */
+void test_algorithm() {
+    printf("Testing Algorithm...\n");
+
+    // Test Case 1: Normal case
+    int test_arr1[] = {1, 2, 3, 4, 5};
+    int size1 = sizeof(test_arr1) / sizeof(test_arr1[0]);
+    int target1=4;
+    int result1 = Binary_search_iterative(test_arr1, size1,target1);
+    printf("Test 1 - Input: {1,2,3,4,5}, Result: %d\n", result1);
+    
+    int result2 = Binary_search_recursive(test_arr1,target1,0,size1-1);
+    printf("Test 1 - Input: {1,2,3,4,5}, Result: %d\n", result2);
+
+    // Test Case 2: Edge case
+    int *test_arr2 = NULL;
+    int result3 = Binary_search_iterative(test_arr2, 0,target1);
+    printf("Test 2 - Edge case handled: %d\n", result3);
+}
 
-    int BinarySearch (int A[],int skey)
-    {
-    int low=0,high=SIZE-1,middle;
-    while (low <=high){
-         middle=(low+high)/2;
-         if(skey==A[middle])
-           return middle;
-         else if(skey <A[middle])
-                  high=middle-1;
-              else 
-                 low=middle+1;
-           }
-       return -1; 
-       }
\ No newline at end of file
+int main() {
+    test_algorithm();
+    return 0;
+}