Simple anagram solver

anagram.cpp

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

int main(int ac, char* av[]) {
        std::vector<std::string> permlist = {"test", "This", "is"};

        if (ac > 1) {
                permlist.clear();

                for (int i = 1; i < ac; i++)
                        permlist.push_back(av[i]);
        }

        std::sort (permlist.begin() , permlist.end());
        do {
                for (const auto& p : permlist)
                        std::cout << p << ' ';
                std::cout << std::endl;
        } while ( std::next_permutation(permlist.begin(), permlist.end()) );

        return 0;
}