首页技术频道51CTO旗下网站地图
社区：论坛博客下载读书更多
最新优质书评 网管员必读   云计算   思科认证专区   数据重现
>> 其他技术>>计算机理论>>
算法：第4版=Algorithms，Fourth Edition
一键收藏，随时查看，分享好友！
算法：第4版=Algorithms，Fourth Edition    [美] Robert Sedgewick,Kevin Wayne
本书作为算法领域经典的参考书，全面介绍了关于算法和数据结构的必备知识，并特别针对排序、搜索、图处理和字符串处理进行了论述。第4 版具体给出了每位程序员应知应会的50 个算法，提供了实际代码，而且这些Java 代码实现采用了模块化的编程风格，读者可以方便地加以改造。本书配套网站提供了本书内容的摘要及更多的代码实现、测试数据、练习、教学课件等资源。本书适合用作大学教材或从业者的参考书。
出版社：人民邮电出版社 出版日期：2012年1月 ISBN：978-7-115-27146-4 定 价：99.00元
关键字： 算法  数据结构  计算机理论  
免责声明：图书版权归出版社和作者所有，51CTO.com 仅提供试读
本书详细信息
Catalog
  • Catalog
    		•
    CHAPTER 1 Fundamentals (1)
  • CHAPTER 1 Fundamentals (1)
  • CHAPTER 1 Fundamentals (2)
  • CHAPTER 1 Fundamentals (3)
  • CHAPTER 1 Fundamentals (4)
  • CHAPTER 1 Fundamentals (5)
    		•
    1.1 Basic Programming Model
  • 1.1 Basic Programming Model (1)
  • 1.1 Basic Programming Model (2)
  • 1.1 Basic Programming Model (3)
  • 1.1 Basic Programming Model (4)
  • 1.1 Basic Programming Model (5)
  • 1.1 Basic Programming Model (6)
  • 1.1 Basic Programming Model (7)
  • 1.1 Basic Programming Model (8)
  • 1.1 Basic Programming Model (9)
  • 1.1 Basic Programming Model (10)
  • 1.1 Basic Programming Model (11)
  • 1.1 Basic Programming Model (12)
  • 1.1 Basic Programming Model (13)
  • 1.1 Basic Programming Model (14)
  • 1.1 Basic Programming Model (15)
  • 1.1 Basic Programming Model (16)
  • 1.1 Basic Programming Model (17)
  • 1.1 Basic Programming Model (18)
  • 1.1 Basic Programming Model (19)
  • 1.1 Basic Programming Model (20)
  • 1.1 Basic Programming Model (21)
  • 1.1 Basic Programming Model (22)
  • 1.1 Basic Programming Model (23)
  • 1.1 Basic Programming Model (24)
  • 1.1 Basic Programming Model (25)
  • 1.1 Basic Programming Model (26)
  • 1.1 Basic Programming Model (27)
  • 1.1 Basic Programming Model (28)
  • 1.1 Basic Programming Model (29)
  • 1.1 Basic Programming Model (30)
  • 1.1 Basic Programming Model (31)
  • 1.1 Basic Programming Model (32)
  • 1.1 Basic Programming Model (33)
  • 1.1 Q&A (1)
  • 1.1 Q&A (2)
  • 1.1 Q&A (3)
  • 1.1 Q&A (4)
  • 1.1 Q&A (5)
  • 1.1 EXERCISES (1)
  • 1.1 EXERCISES (2)
  • 1.1 EXERCISES (3)
  • 1.1 EXERCISES (4)
  • 1.1 EXERCISES (5)
  • 1.1 EXERCISES (6)
  • 1.1 CREATIVE PROBLEMS (1)
  • 1.1 CREATIVE PROBLEMS (2)
  • 1.1 CREATIVE PROBLEMS (3)
  • 1.1 EXPERIMENTS (1)
    		•
    1.2 Data Abstraction
  • 1.2 Data Abstraction (1)
  • 1.2 Data Abstraction (2)
  • 1.2 Data Abstraction (3)
  • 1.2 Data Abstraction (4)
  • 1.2 Data Abstraction (5)
  • 1.2 Data Abstraction (6)
  • 1.2 Data Abstraction (7)
  • 1.2 Data Abstraction (8)
  • 1.2 Data Abstraction (9)
  • 1.2 Data Abstraction (10)
  • 1.2 Data Abstraction (11)
  • 1.2 Data Abstraction (12)
  • 1.2 Data Abstraction (13)
  • 1.2 Data Abstraction (14)
  • 1.2 Data Abstraction (15)
  • 1.2 Data Abstraction (16)
  • 1.2 Data Abstraction (17)
  • 1.2 Data Abstraction (18)
  • 1.2 Data Abstraction (19)
  • 1.2 Data Abstraction (20)
  • 1.2 Data Abstraction (21)
  • 1.2 Data Abstraction (22)
  • 1.2 Data Abstraction (23)
  • 1.2 Data Abstraction (24)
  • 1.2 Data Abstraction (25)
  • 1.2 Data Abstraction (26)
  • 1.2 Data Abstraction (27)
  • 1.2 Data Abstraction (28)
  • 1.2 Data Abstraction (29)
  • 1.2 Data Abstraction (30)
  • 1.2 Data Abstraction (31)
  • 1.2 Data Abstraction (32)
  • 1.2 Data Abstraction (33)
  • 1.2 Data Abstraction (34)
  • 1.2 Data Abstraction (35)
  • 1.2 Data Abstraction (36)
  • 1.2 Data Abstraction (37)
  • 1.2 Data Abstraction (38)
  • 1.2 Data Abstraction (39)
  • 1.2 Data Abstraction (40)
  • 1.2 Data Abstraction (41)
  • 1.2 Data Abstraction (42)
  • 1.2 Data Abstraction (43)
  • 1.2 Data Abstraction (44)
  • 1.2 Data Abstraction (45)
  • 1.2 Data Abstraction (46)
  • 1.2 Data Abstraction (47)
  • 1.2 Q & A (1)
  • 1.2 Q & A (2)
  • 1.2 Q & A (3)
  • 1.2 Q & A (4)
  • 1.2 Q & A (4)
  • 1.2 EXERCISES (1)
  • 1.2 EXERCISES (2)
  • 1.2 CREATIVE PROBLEMS (1)
  • 1.2 CREATIVE PROBLEMS (2)
  • 1.2 CREATIVE PROBLEMS (3)
    		•
    1.3 Bags, Queues, and Stacks
  • 1.3 Bags, Queues, and Stacks (1)
  • 1.3 Bags, Queues, and Stacks (2)
  • 1.3 Bags, Queues, and Stacks (3)
  • 1.3 Bags, Queues, and Stacks (4)
  • 1.3 Bags, Queues, and Stacks (5)
  • 1.3 Bags, Queues, and Stacks (6)
  • 1.3 Bags, Queues, and Stacks (7)
  • 1.3 Bags, Queues, and Stacks (8)
  • 1.3 Bags, Queues, and Stacks (9)
  • 1.3 Bags, Queues, and Stacks (10)
  • 1.3 Bags, Queues, and Stacks (11)
  • 1.3 Bags, Queues, and Stacks (12)
  • 1.3 Bags, Queues, and Stacks (13)
  • 1.3 Bags, Queues, and Stacks (14)
  • 1.3 Bags, Queues, and Stacks (15)
  • 1.3 Bags, Queues, and Stacks (16)
  • 1.3 Bags, Queues, and Stacks (17)
  • 1.3 Bags, Queues, and Stacks (18)
  • 1.3 Bags, Queues, and Stacks (19)
  • 1.3 Bags, Queues, and Stacks (20)
  • 1.3 Bags, Queues, and Stacks (21)
  • 1.3 Bags, Queues, and Stacks (22)
  • 1.3 Bags, Queues, and Stacks (23)
  • 1.3 Bags, Queues, and Stacks (24)
  • 1.3 Bags, Queues, and Stacks (25)
  • 1.3 Bags, Queues, and Stacks (26)
  • 1.3 Bags, Queues, and Stacks (27)
  • 1.3 Q&A (1)
  • 1.3 Q&A (2)
  • 1.3 Q&A (3)
  • 1.3 EXERCISES (1)
  • 1.3 EXERCISES (2)
  • 1.3 EXERCISES (3)
  • 1.3 LINKED-LIST EXERCISES (1)
  • 1.3 LINKED-LIST EXERCISES (2)
  • 1.3 CREATIVE PROBLEMS (1)
  • 1.3 CREATIVE PROBLEMS (2)
  • 1.3 CREATIVE PROBLEMS (3)
    		•
    1.4
  • 1.4 Analysis of Algorithms (1)
  • 1.4 Analysis of Algorithms (2)
  • 1.4 Analysis of Algorithms (3)
  • 1.4 Analysis of Algorithms (4)
  • 1.4 Analysis of Algorithms (5)
  • 1.4 Analysis of Algorithms (6)
  • 1.4 Analysis of Algorithms (7)
  • 1.4 Analysis of Algorithms (8)
  • 1.4 Analysis of Algorithms (9)
  • 1.4 Analysis of Algorithms (10)
  • 1.4 Analysis of Algorithms (11)
  • 1.4 Analysis of Algorithms (12)
  • 1.4 Analysis of Algorithms (13)
  • 1.4 Analysis of Algorithms (14)
  • 1.4 Analysis of Algorithms (15)
  • 1.4 Analysis of Algorithms (16)
  • 1.4 Analysis of Algorithms (17)
  • 1.4 Analysis of Algorithms (18)
  • 1.4 Analysis of Algorithms (19)
  • 1.4 Analysis of Algorithms (20)
  • 1.4 Analysis of Algorithms (21)
  • 1.4 Analysis of Algorithms (22)
  • 1.4 Analysis of Algorithms (23)
  • 1.4 Analysis of Algorithms (24)
  • 1.4 Analysis of Algorithms (25)
  • 1.4 Analysis of Algorithms (26)
  • 1.4 Analysis of Algorithms (27)
  • 1.4 Analysis of Algorithms (28)
  • 1.4 Analysis of Algorithms (29)
  • 1.4 Analysis of Algorithms (30)
  • 1.4 Analysis of Algorithms (31)
  • 1.4 Analysis of Algorithms (32)
  • 1.4 Analysis of Algorithms (33)
  • 1.4 Analysis of Algorithms (34)
  • 1.4 Q&A (1)
  • 1.4 Q&A (2)
  • 1.4 Q&A (3)
  • 1.4 Q&A (4)
  • 1.4 CREATIVE PROBLEMS (1)
  • 1.4 CREATIVE PROBLEMS (2)
  • 1.4 CREATIVE PROBLEMS (3)
  • 1.4 EXPERIMENTS
    • 1.5
  • 1.5 Case Study: Union-Find (1)
  • 1.5 Case Study: Union-Find (2)
  • 1.5 Case Study: Union-Find (3)
  • 1.5 Case Study: Union-Find (4)
  • 1.5 Case Study: Union-Find (5)
  • 1.5 Case Study: Union-Find (6)
  • 1.5 Case Study: Union-Find (7)
  • 1.5 Case Study: Union-Find (8)
  • 1.5 Case Study: Union-Find (9)
  • 1.5 Case Study: Union-Find (10)
  • 1.5 Case Study: Union-Find (11)
  • 1.5 Case Study: Union-Find (12)
  • 1.5 Case Study: Union-Find (13)
  • 1.5 Case Study: Union-Find (14)
  • 1.5 Case Study: Union-Find (15)
  • 1.5 Q&A
  • 1.5 EXERCISES (1)
  • 1.5 EXERCISES (2)
  • 1.5 EXERCISES (3)
  • 1.5 EXPERIMENTS
    		•
    随便说两句
    留言共条
    匿名发表 验证码： (点击进行更换)
    作译者简介
    [美] Robert Sedgewick,Kevin Wayne
      Robert Sedgewick 斯坦福大学博士，导师为Donald E. Knuth，从1985年开始一直担任普林斯顿大学计算机科学系教授，曾任该系主任，也是Adobe Systems公司董事会成员，曾在Xerox PARC、国防分析研究所（institute for Defense Analyses）和法国国家信息与自动化研究所（INRIA）
    本作者其他图书
    无
    相关图书
    程序设计实践双语版
       作者：Brian W. Kernighan,Rob Pike 裘宗燕译
      程序设计实践并不只是写代码。程序员必须评论各种折衷方案，在许多可能性之中做出选择、排除错误、做测试和改进程序性
    ·浮点计算编程原理、实现与应用
    月排行榜
    更多>>
    ·千万别犯！50个致命的职场过失
    ·高性能Linux服务器构建实战：运维监
    ·成功人士不说，却默默在做的30件事
    ·疯狂的站长-从穷站长到富站长
    ·编写高质量代码：改善Java程序的151
    ·MongoDB管理与开发精要
    ·30秒变身求职达人
    ·乔布斯语录
    ·.NET应用架构设计：原则、模式与实践
    ·OCA认证考试指南(1Z0-047)：Oracle D
    相关技术专题
    热点标签
    移动开发   云计算   ARP攻防   软考专题   上网行为管理

    51CTO旗下网站

    领先的IT技术网站 51CTO 领先的中文存储媒体 WatchStor 中国首个CIO网站 CIOage 中国首家数字医疗网站 HC3i 移动互联网生活门户 灵客风LinkPhone