diff --git a/Sorting/sorting.c b/Sorting/sorting.c
new file mode 100644
index 0000000..47aca42
--- /dev/null
+++ b/Sorting/sorting.c
@@ -0,0 +1,36 @@
+#include <stdio.h>
+    void main()
+    {
+ 
+        int i, j, a, n, num[30];
+        printf("Enter the value of N \n");
+        scanf("%d", &n);
+ 
+        printf("Enter the numbers \n");
+        for (i = 0; i < n; ++i)
+            scanf("%d", &num[i]);
+ 
+        for (i = 0; i < n; ++i) 
+        {
+ 
+            for (j = i + 1; j < n; ++j)
+            {
+ 
+                if (num[i] > num[j]) 
+                {
+ 
+                    a =  num[i];
+                    num[i] = nu[j];
+                    num[j] = a;
+ 
+                }
+ 
+            }
+ 
+        }
+ 
+        printf("The numbers arranged in ascending order are given below \n");
+        for (i = 0; i < n; ++i)
+            printf("%d\n", num[i]);
+ 
+    }
diff --git a/reversearrayelement.cpp b/reversearrayelement.cpp
new file mode 100644
index 0000000..32f646c
--- /dev/null
+++ b/reversearrayelement.cpp
@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+	int t;
+    cin >> t;
+    while(t--)
+    {
+        int n,cnt=0;
+        cin>>n;
+        int a[n];
+        
+        for(int i=0;i<n;i++)
+        {
+            cin>>a[i];
+        }
+        reverse(a,a+n);
+        for(int i=0;i<n;i++)
+        {
+            cout<<a[i]<<" ";
+        }
+        cout<<endl;
+    }
+	
+	return 0;
+}
+
+// T.C = O(n)
+// S.C = O(n)