diff --git a/Mradul_Lakhotiya/bubble_sort.c b/Mradul_Lakhotiya/bubble_sort.c
new file mode 100644
index 0000000..8d8006d
--- /dev/null
+++ b/Mradul_Lakhotiya/bubble_sort.c
@@ -0,0 +1,38 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void bubble_sort (int n, int arr[]) {
+    int i=0;
+    if (n<=1) {
+        return;
+    }
+    //sort 
+    for (int i = 0; i < n - 1; i++) {
+        if (arr[i] > arr[i + 1]) {
+            int temp = arr[i];
+            arr[i] = arr[i + 1];
+            arr[i + 1] = temp;
+        }
+    }
+    bubble_sort (n-1,arr);
+}
+
+int main () {
+    int n; //input the array
+    printf ("Enter the number Elements : ");
+    scanf ("%d",&n);
+
+    int arr[n];
+
+    for (int i=0; i<n; i++) {
+        printf ("Enter the arr[%d] : ",i);
+        scanf ("%d",&arr[i]);
+    }
+    
+    bubble_sort (n , arr);
+
+    printf ("The sorted array is : ");
+    for (int i=0; i<n; i++) {
+        printf ("%d\n",arr[i]);
+    }
+}
\ No newline at end of file
diff --git a/Mradul_Lakhotiya/index_finder.c b/Mradul_Lakhotiya/index_finder.c
new file mode 100644
index 0000000..ad00c89
--- /dev/null
+++ b/Mradul_Lakhotiya/index_finder.c
@@ -0,0 +1,53 @@
+#include <stdio.h>
+
+int finder (int n, int arr[], int find, int low) {
+    int high, mid;
+    high = n-1;
+    mid = (low+high)/2;
+    if (find == arr[mid]) {
+        return mid;
+    } else if (find > arr[mid]) {
+        finder (n,arr,find,mid + 1);
+    } else {
+        finder (mid,arr,find,low);
+    }
+}
+
+int main () {
+    int n, find, low=0;
+
+    printf ("Enter the number Elements : ");
+    scanf ("%d",&n);
+
+    int arr[n];
+
+    for (int i=0; i<n; i++) {
+        printf ("Enter the arr[%d] : ",i);
+        scanf ("%d",&arr[i]);
+    }
+
+    for (int i=0; i<n; i++) {
+        int minindex=i;
+        for (int j= i+1; j<n; j++) {
+            if (arr[j]<arr[minindex]) {
+                minindex = j;
+            }
+        }
+        int temp = arr[i];
+        arr[i] = arr[minindex];
+        arr[minindex] = temp;
+    }
+
+    printf ("The sorted array is : \n");
+
+    for (int i=0; i<n; i++) {
+        printf ("%d\n",arr[i]);
+    }
+
+    printf ("Enter the elemeten to be found : ");
+    scanf ("%d",&find);
+
+    int mid = finder (n,arr,find,low);
+
+    printf ("The index of the Given number is : %d",mid);
+}
diff --git a/Mradul_Lakhotiya/recursive_function_Fibonacci.c b/Mradul_Lakhotiya/recursive_function_Fibonacci.c
new file mode 100644
index 0000000..6287ebe
--- /dev/null
+++ b/Mradul_Lakhotiya/recursive_function_Fibonacci.c
@@ -0,0 +1,25 @@
+#include <stdio.h>
+
+void Fabonacci (int i, int j, int n) {
+    if (n==0) {
+        return;
+    }
+    printf ("%d\n",i);
+    int temp;
+    temp = i;
+    i = j;
+    j = j + temp;
+    n--;
+
+    Fabonacci (i,j,n);
+}
+
+int main () {
+    int n;
+    printf ("Enter the number till you want Fibonacci seres : ");
+    scanf ("%d",&n);
+
+    Fabonacci (0,1,n);
+
+    return 0;
+}
\ No newline at end of file
diff --git a/Mradul_Lakhotiya/recursive_power.c b/Mradul_Lakhotiya/recursive_power.c
new file mode 100644
index 0000000..7b04d7b
--- /dev/null
+++ b/Mradul_Lakhotiya/recursive_power.c
@@ -0,0 +1,23 @@
+#include <stdio.h>
+
+int powfinder(int num, int pow) {
+    if (pow == 0) {
+        return 1;
+    } else {
+        return num * powfinder(num, pow - 1);
+    }
+}
+
+int main() {
+    int num, pow;
+    printf("Enter the Number: ");
+    scanf("%d", &num);
+    printf("Enter the power: ");
+    scanf("%d", &pow);
+
+    int result = powfinder(num, pow);
+
+    printf("The Answer is: %d\n", result);
+
+    return 0;
+}
diff --git a/Mradul_Lakhotiya/selection_sort.c b/Mradul_Lakhotiya/selection_sort.c
new file mode 100644
index 0000000..fcec0e3
--- /dev/null
+++ b/Mradul_Lakhotiya/selection_sort.c
@@ -0,0 +1,30 @@
+#include <stdio.h>
+
+int main () {
+    int n;
+    printf ("Enter the number Elements : ");
+    scanf ("%d",&n);
+    int arr[n];
+    for (int i=0; i<n; i++) {
+        printf ("Enter the arr[%d] : ",i);
+        scanf ("%d",&arr[i]);
+    }
+
+    for (int i=0; i<n; i++) {
+        int minindex=i;
+        for (int j= i+1; j<n; j++) {
+            if (arr[j]<arr[minindex]) {
+                minindex = j;
+            }
+        }
+        int temp = arr[i];
+        arr[i] = arr[minindex];
+        arr[minindex] = temp;
+    }
+
+    printf ("The sorted array is : \n");
+    for (int i=0; i<n; i++) {
+        printf ("%d\n",arr[i]);
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/Mradul_Lakhotiya/string_palindrome.c b/Mradul_Lakhotiya/string_palindrome.c
new file mode 100644
index 0000000..d76354d
--- /dev/null
+++ b/Mradul_Lakhotiya/string_palindrome.c
@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <string.h>
+
+int main() {
+    char str[100];
+    printf("Enter the string: ");
+    scanf(" %s", str); 
+
+    int n = strlen(str);
+    char ostr[n + 1]; 
+
+    strcpy(ostr, str);
+
+    int i = 0, j = n - 1;
+
+    while (i < j) {
+        char temp = str[i];
+        str[i] = str[j];
+        str[j] = temp;
+        i++;
+        j--;
+    }
+
+    if (strcmp(ostr, str) == 0) {
+        printf("%s is a palindrome.\n", ostr);
+    } else {
+        printf("%s is not a palindrome.\n", ostr);
+    }
+
+    return 0;
+}
diff --git a/Mradul_Lakhotiya/voval_cheaker.c b/Mradul_Lakhotiya/voval_cheaker.c
new file mode 100644
index 0000000..c7a9cf6
--- /dev/null
+++ b/Mradul_Lakhotiya/voval_cheaker.c
@@ -0,0 +1,20 @@
+#include <stdio.h>
+#include <string.h>
+
+int main () {
+    int count=0;
+    char str[100];
+    printf ("Enter the string : ");
+    scanf ("%s",&str);
+
+    int n=strlen(str);
+
+    for (int i=0; i<n; i++) {
+        if (str[i]=='a' || str[i]=='e' || str[i]=='i' || str[i]=='o' || str[i]=='u' || str[i]=='A' || str[i]=='E' || str[i]=='I' || str[i]=='O' || str[i]=='U') {
+            count++;
+        }
+    }
+    printf ("The Number of vovales in thr given sting are %d",count);
+
+    return 0;
+}
\ No newline at end of file