Permutation 算法

AIFantasy — Sat, 02 Jun 2007 15:58:00 GMT

void permutation(string s, int n, int start = 0)
{
    if(start == n)
    {
        string temp = s.substr(0, n);
        cout << temp << endl;
    }
    else
    {
        for(int i = start; i < s.size(); i++)
        {
            char temp = s[start];
            s[start] = s[i];
            s[i] = temp;

            permutation(s, n, start + 1);

            s[i] = s[start];
            s[start] = temp;
        }
    }
}

AIFantasy 2007-06-02 23:58 发表评论

A*算法理论与实践

AIFantasy — Mon, 30 Apr 2007 01:11:00 GMT

ＣＳＤＮ上看到的，感觉写得很好
http://blog.csdn.net/EmilMatthew/archive/2006/10/17/1338808.aspx

AIFantasy 2007-04-30 09:11 发表评论

IT博客-AI Fantasy-随笔分类-算法设计

Permutation 算法

A*算法理论与实践