diff --git a/arrayreversal.c b/arrayreversal.c
new file mode 100644
index 0000000..218b35d
--- /dev/null
+++ b/arrayreversal.c
@@ -0,0 +1,22 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main()
+{
+    int num,x, *a, i,*b;
+    scanf("%d", &num);
+    a = (int*) malloc(num * sizeof(int));
+    b = (int*) malloc(num * sizeof(int));
+    for(i = 0; i < num; i++) {
+        scanf("%d\t", &x);
+        a[i]=x;
+    }
+    for (i=0;i<num;i++)
+    {b[num-1-i]=a[i];}
+
+
+    for(i = 0; i < num; i++)
+        printf("%d ", b[i]);
+    return 0;
+}
+
diff --git a/powerfun.c b/powerfun.c
new file mode 100644
index 0000000..cb0857d
--- /dev/null
+++ b/powerfun.c
@@ -0,0 +1,27 @@
+#include<stdio.h>
+int main()
+{
+    int a,r;
+    int res;
+    printf("entre the base:-");
+    scanf("%d",&a);
+    printf("Entre the power:-");
+    scanf("%d",&r);
+    res=pow(a,r);
+    printf("%d",res);
+    return 0;
+}
+int pow(int a,int r)
+{
+    if(r==0)
+         return 1;
+    else if (r==1)
+        return a;
+    else
+    {int d=pow(a,r/2);
+        if(r%2==0)
+            return d*d;
+        else
+            return d*a*d;
+    }
+}
diff --git a/recursivesum.c b/recursivesum.c
new file mode 100644
index 0000000..a7bfbdb
--- /dev/null
+++ b/recursivesum.c
@@ -0,0 +1,26 @@
+#include<stdio.h>
+int main()
+{
+        int x,n;
+        scanf("%d",&n);
+        x=sum(n);
+        printf("%d",x);
+        return 0;
+}
+int sum(int n)
+{int a,b,c;
+int p=0;
+        scanf("%d",&a);
+        scanf("%d",&b);
+        scanf("%d",&c);
+    if (n>3)
+    return p=sum(n-1)+sum(n-2)+sum(n-3);
+    else if (n==1)
+        return a;
+    else if (n==2)
+        return b;
+    else if (n==3)
+        return c;
+
+    return p;
+}
diff --git a/vedant.c b/vedant.c
new file mode 100644
index 0000000..b2cb0d9
--- /dev/null
+++ b/vedant.c
@@ -0,0 +1,8 @@
+#include<stdio.h>
+int main()
+{
+int a,b,sum;
+scanf("%d %d",&a,&b);
+sum=a+b;
+printf("%d",sum);
+return 0;}
\ No newline at end of file