From c50086553ec1f17dd6e59d9686ef10bde0c2d1c4 Mon Sep 17 00:00:00 2001
From: Teja <a.tejarao1999@gmail.com>
Date: Mon, 6 Feb 2023 16:25:25 +0530
Subject: [PATCH 1/2] Teja.txt

---
 Teja/f1 | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 Teja/f1

diff --git a/Teja/f1 b/Teja/f1
new file mode 100644
index 0000000..c02a781
--- /dev/null
+++ b/Teja/f1
@@ -0,0 +1 @@
+Hi My name is Tejatejaa.txt
\ No newline at end of file

From 2f20cdcc55013c6b2be865927867346b2aec7411 Mon Sep 17 00:00:00 2001
From: Teja <a.tejarao1999@gmail.com>
Date: Tue, 7 Feb 2023 16:17:29 +0530
Subject: [PATCH 2/2] addedd recursion file

---
 recursion.c | 29 +++++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 recursion.c

diff --git a/recursion.c b/recursion.c
new file mode 100644
index 0000000..397c67e
--- /dev/null
+++ b/recursion.c
@@ -0,0 +1,29 @@
+#include <stdio.h>
+
+int recursive_binary_search(int arr[], int l, int r, int value) {
+    int mid = (l+r)/2;
+    if(value == arr[mid])
+        return mid;
+    if ((value > arr[l]) && (value < arr[mid]))
+        return recursive_binary_search(arr, l, mid-1, value);
+    else if ((value > arr[mid]) && (value < arr[r]))
+        return recursive_binary_search(arr, mid+1, r, value);
+}
+
+int main() {
+    int n, f;
+    printf("Enter size of the array \n");
+    scanf("%d", &n);
+
+    int arr[n];
+    for(int i=0; i<n; i++) {
+        printf("Enter Element %d of the array \n", i+1);
+        scanf("%d", &arr[i]);
+    }
+
+    printf("Enter the element to be find \n");
+    scanf("%d", &f);
+
+    int x = recursive_binary_search(arr, 0, n-1, f);
+    printf("%d", x);
+}
\ No newline at end of file