Coolness

#include <iostream>
#include <functional>
#include <algorithm>
using namespace std;

int main()
{
    const int size = 10;

    function<unsigned long(unsigned long)> func;

    func = [&](unsigned long x) -> unsigned long
    {
        if(x <= 1)
            return 1;
        return x * func(x - 1);
    };

    int ints[size];
    for(int i = 0; i < size; i++)
        ints[i] = func(i + 1);

    vector<int> vec (ints, ints + size);

    for(int x : vec)
        printf("%i\n", x);

    printf("Sorting...\n");

    sort(vec.begin(), vec.begin() + size, [](int a, int b)
    {
        return a > b;
    });

    for(int x : vec)
        printf("%i\n", x);

    return 0;
}