The Brute algorithm

void algorithm(unsigned char s, unsigned char e, const unsigned l)
{
    bool end = false;
    unsigned cell = 0;
    unsigned char *password = new unsigned char[l];

    memset(password, '\r', l);

    while (!end)
    {
        if (password[cell] < e)
        {
            if (password[cell] < s) password[cell] = s; //Here shit
            ++password[cell];
        }
        if (password[cell] == e && cell < l)
        {
            link: //While, yep, but.. GOTO IS NOT TO BAD

            while (password[cell] == e)
            {
                ++cell;
                if (cell == l && password[cell]) return;

                password[cell - 1] = s;
            }

            ++password[cell]; //if we move it out while we ... THOUGHT HAS BEEN LOSE.

            if (password[cell] < s) password[cell] = s; //And here shit too

            while(cell > 0 && password[cell - 1] < e) --cell;
        }
    }

    delete[] password;
}

//Here you can see piece of shit.