Selection sort

#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];
    }

    for (int i = 0; i < n; ++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;
}
/*
Time Complexity O(N^2)
Memory Complexity O(1)
*/