J2EE之巅

 

Computer Science

The Clojure Program To solve N Queens Problem
     摘要: The following program is about solving N-Queens problem (http://en.wikipedia.org/wiki/Eight_queens_puzzle) by Clojure. If you could let the program better just provide your solution  阅读全文

posted @ 2012-08-05 23:26 超越巅峰 阅读(2428) | 评论 (0)  编辑

TDD Tips
     摘要: How to design the testable software? You may always find some best practices about designing for scalable, extensible or maintainable. To be testable, the best way should be TDD. Followings are some tips from my real practices on TDD.  阅读全文

posted @ 2011-01-09 16:55 超越巅峰 阅读(3363) | 评论 (1)  编辑

算法的时间复杂度
     摘要: 介绍如何计算算法的时间复杂度  阅读全文

posted @ 2010-06-18 15:26 超越巅峰 阅读(3543) | 评论 (1)  编辑

导航

统计

常用链接

留言簿(12)

随笔分类(54)

随笔档案(59)

文章分类(2)

文章档案(1)

相册

搜索

积分与排名

最新评论

阅读排行榜

评论排行榜