diff --git a/CODE in C/Data Structures/Array_reversal.c b/CODE in C/Data Structures/Array_reversal.c
index b28e84b..5e417c0 100644
--- a/CODE in C/Data Structures/Array_reversal.c	
+++ b/CODE in C/Data Structures/Array_reversal.c	
@@ -1,16 +1,13 @@
 #include <stdio.h>
-#include <stdlib.h>
 
 int main()
 {
-    int num, *arr, i;
+    int num, i;
     scanf("%d", &num);
-    arr = (int*) malloc(num * sizeof(int));
+    int arr[num];
     for(i = 0; i < num; i++) {
         scanf("%d", arr + i);
     }
-
-
     /* Write the logic to reverse the array. */
     int temp,ip=0,fp=num-1;
     while(ip < fp )
@@ -22,7 +19,8 @@ int main()
         fp--;
     }
 
-    for(i = 0; i < num; i++)
+    for(i = 0; i < num-1; i++)
         printf("%d ", *(arr + i));
+    printf("%d",*(arr+num-1));
     return 0;
 }
diff --git a/CODE in C/Data Structures/pointers_concept.c b/CODE in C/Data Structures/pointers_concept.c
index ac4940f..d98814b 100644
--- a/CODE in C/Data Structures/pointers_concept.c	
+++ b/CODE in C/Data Structures/pointers_concept.c	
@@ -9,10 +9,9 @@ void update(int *a,int *b) {
 
 int main() {
     int a, b;
-    int *pa = &a, *pb = &b;
     
     scanf("%d %d", &a, &b);
-    update(pa, pb);
+    update(&a, &b);
     printf("%d\n%d", a, b);
 
     return 0;