Selection sort using C++ Done

Author: MohammadFahad1

.cph/.E_Max.cpp_9919bda6f2afb01d769ca43dc87d9c03.prob

@@ -0,0 +1 @@
+{"name":"E. Max","group":"Codeforces - Sheet #2 (Loops)","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/E","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5\n1 8 5 7 5\n","output":"8\n","id":1718697543652}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"EMax"}},"batch":{"id":"fce6e903-a7aa-43a4-8da5-d35279de29d5","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\2. Introduction to C++\\E_Max.cpp"}

.cph/.H_Sorting.cpp_2498440c261c84f59160c1193c924e4c.prob

@@ -1 +1 @@
-{"name":"H. Sorting","group":"Codeforces - Sheet #3 (Arrays)","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/H","interactive":false,"memoryLimit":64,"timeLimit":1000,"tests":[{"input":"3\n3 1 2\n","output":"1 2 3\n","id":1718696982454},{"input":"4\n5 2 7 3\n","output":"2 3 5 7\n","id":1718696982520}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"HSorting"}},"batch":{"id":"271dabfb-f1c6-4ea3-b328-2236e41faba0","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\2. Introduction to C++\\H_Sorting.cpp"}
+{"name":"H. Sorting","group":"Codeforces - Sheet #3 (Arrays)","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/H","interactive":false,"memoryLimit":64,"timeLimit":1000,"tests":[{"input":"3\n3 1 2\n","output":"1 2 3\n","id":1718696982454},{"id":1718696982520,"input":"4\n5 2 7 3\n","output":"2 3 5 7\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"HSorting"}},"batch":{"id":"271dabfb-f1c6-4ea3-b328-2236e41faba0","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\2. Introduction to C++\\H_Sorting.cpp"}

E_Max.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    int a[n];
+    for (int i = 0; i < n; i++)
+    {
+        cin >> a[i];
+    }
+
+    // Sorting the array using selection sort
+    for (int i = 0; i < n - 1; i++)
+    {
+        for (int j = i + 1; j < n; j++)
+        {
+            if (a[i] >= a[j])
+            {
+                swap(a[i], a[j]);
+            }
+        }
+    }
+
+    for (int i = 0; i < n; i++)
+    {
+        cout << a[i] << " ";
+    }
+
+    return 0;
+}

H_Sorting.bin

@@ -1 +1,2 @@
-10 20 30 40 50
+5
+2 2 1 7 5

H_Sorting.cpp

@@ -1 +1 @@
-10 20 30 40 50 
+1 2 2 5 7