文件名称:algorithms
- 所属分类：
- 单片机(51,AVR,MSP430等)
- 资源属性：
- [PDF]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1.6mb
- 下载次数：
- 0次
- 提 供 者：
- lixi****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
Algorithms
Copyright c
2006 S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani
July 18, 2006-This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of teaching this course evolved tremendously over these years in a number of directions, partly to address our students background (undeveloped formal skills outside of programming), and partly to rect the maturing of the eld in general, as we have come to see it. The notes increasingly crystallized into a narrative, and we progressively structured the course to emphasize the “ story line” implicit in the progression of the material. As a result, the topics were carefully selected and clustered. No attempt was made to be encyclopedic, and this freed us to include topics traditionally de-emphasized or omitted from most Algorithms books.
Copyright c
2006 S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani
July 18, 2006-This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of teaching this course evolved tremendously over these years in a number of directions, partly to address our students background (undeveloped formal skills outside of programming), and partly to rect the maturing of the eld in general, as we have come to see it. The notes increasingly crystallized into a narrative, and we progressively structured the course to emphasize the “ story line” implicit in the progression of the material. As a result, the topics were carefully selected and clustered. No attempt was made to be encyclopedic, and this freed us to include topics traditionally de-emphasized or omitted from most Algorithms books.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
algorithms.pdf