My inefficient (very inefficient) permutations

permutations.cpp

/*

Do NOT use it. It is not efficient.

*/

#include <iostream>
#include <vector>
#include <algorithm>

void printVec(const std::vector<int>& s)
{
    for (auto v : s)
        std::cout << v + 1;
    std::cout << "\n";
}

int findAtLeast(size_t from, std::vector<int>& vec, int at_least)
{
    if (at_least > vec.size())
        return -1;
    for (int i = from; i < vec.size(); i++)
        if (vec[i] == at_least)
            return i;
    return findAtLeast(from, vec, at_least + 1);
}

bool go(std::vector<int>& s, int id)
{
    if (id == s.size() - 2)
    {
        if (s[id + 1] > s[id])
        {
            std::swap(s[id + 1], s[id]);
            return true;
        } else
            return false;
    }
    if (go(s, id + 1))
        return true;
    auto nextIndex = findAtLeast(id + 1, s, s[id] + 1);
    if (nextIndex == -1)
        return false;
    auto next = s[nextIndex];

    std::swap(s[nextIndex], s[id]);
    std::sort(s.begin() + id + 1, s.end());
    return true;
}

int main()
{
    int N;
    std::cin >> N;
    if (N == 1)
    {
        std::cout << 1;
        return 0;
    }
    std::vector<int> s(N);
    for (int i = 0; i < N; i++)
        s[i] = i;
    do
    {
        printVec(s);
    }
    while(go(s, 0));
}