J2EE之巅

 

11 2012 档案

The Clojure Program To solve N Queens Problem (Without back tracing)
     摘要: Not like the previous solution here http://www.blogjava.net/chaocai/archive/2012/08/05/384844.html
The following solution not using the back tracing way is more concise and readable, but for the searching space becomes huger, the performance is much worser then the previous one.  阅读全文

posted @ 2012-11-26 12:21 超越巅峰 阅读(2830) | 评论 (0)  编辑

导航

统计

常用链接

留言簿(12)

随笔分类(54)

随笔档案(59)

文章分类(2)

文章档案(1)

相册

搜索

积分与排名

最新评论

阅读排行榜

评论排行榜