《设计模式》
Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms.
Addison-Wesley, 1974. The classic text, but it lacks topics in network
flows and linear programming, as well as more recent algorithms.
Aho， Alfred V.， John E. Hopcroft， 与 Jeffrey D. Ullman. 《数据结构与算法》 Addison-Wesley， 1983. 是《计算机算法之设计与分析》前六章所改写的较基本版本。
Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms.
Addison-Wesley, 1983. Revised and more elementary version of the first
six chapters of The Design and Analysis of Computer Algorithms.
Baase， Sara. 《计算机算法：设计与分析导论，第二版》 Addison-Wesley， 1988. 一般参考书，尽管它的说明有时是精简或概要的。Baase, Sara. Computer Algorithms: Introction to Design and Analysis. 2nd ed. Addison-Wesley, 1988. General reference, although the exposition is sometimes terse or sketchy.
Bentley， Jon. 《程序设计明珠》 Addison-Wesley， 1986. 应用算法设计技巧在软件工程中。（Programming Pearls 繁体中文版, 译者：许鸣程，出版商：基峰，出版日期：2001-11-22，ISBN：9575668804）Bentley, Jon. Programming Pearls. Addison-Wesley, 1986. Applications of algorithm design techniques to software engineering.
Bentley， Jon. 《更多的程序设计明珠》 Addison-Wesley， 1988. 更多算法设计在软件工程中的实用。Bentley, Jon. More Programming Pearls. Addison-Wesley, 1988. More applications of algorithm design techniques to software engineering.
Bentley， Jon Louis. 《编写有效率的程序》 Prentice-Hall， 1982.对程序效能提升有特殊的助益。Bentley, Jon Louis. Writing Efficient Programs. Prentice-Hall, 1982. Performance hacking extraordinaire.
Brassard， Gilles 与 Paul Bratley. 《算法：理论与实作》，Prentice-Hall， 1988. 很好的范例及习题，着重于方法而不是个别的问题。Brassard, Gilles and Paul Bratley. Algorithmics: Theory and Practice. Prentice-Hall, 1988. Good examples and problems. Focus on methods rather than specific problems.
Chung， Kai Lai. 《基础概率理论与随机过程》，Springer-Verlag， 1974. 对概率作直觉性的介绍。Chung, Kai Lai. Elementary Probability Theory with Stochastic Processes. Springer-Verlag, 1974. Intuitive introction to probability.
Even， Shimon. 《图形算法》，Computer Science Press， 1979. 对图形算法有广泛的论述，包含了网络流量及平面图。Even, Shimon. Graph Algorithms. Computer Science Press, 1979. Broad treatment of graph algorithms, including network flow and planarity.
希望可以帮到你
点击我的ID，可以了解更多关于装修的知识