Amazon CAPTCHA
请输入您在这个图片中看到的字符：
& , , Inc. or its affiliatesAmazon CAPTCHA
请输入您在这个图片中看到的字符：
& , , Inc. or its affiliates扫一扫下载手机客户端
扫描我，关注团购信息，享更多优惠
||网络安全
| | | | | | | | | | | | | | | |
||电子电工
汽车交通| | | | | | | | | |
||投资理财
| | | | | | | | | | | | | | | | |
| | | | | | |
| | | | | | | | | | | | | | | | | | |
| | | | | | |||
||外语考试
| | | | | | | | |
| 视频教程|
数据结构与算法分析:Java语言描述(英文版?第3版)(国外数据结构与算法分析方面的经典教材)
定价：￥79.00
校园优惠价：￥56.88 (72折)
促销活动：
商品已成功飞到您的手机啦！快登录手机站看看吧！
下载客户端
> 微信关注“互动出版网”，便捷查询订单，更多惊喜天天有
原书名：Data Structures and Algorithm Analysis in Java (3rd Edition)
原出版社：
ISBN：6上架时间：出版日期：2013 年2月开本：16页码：614版次：1-1
所属分类：
《数据结构与算法分析Java语言描述(英文版?第3版)》是国外数据结构与算法分析方面的经典教材，使用卓越的Java编程语言作为实现工具讨论了数据结构(组织大量数据的方法)和算法分析(对算法运行时间的估计)。
随着计算机速度的不断增加和功能的日益强大，人们对有效编程和算法分析的要求也不断增长。本书将算法分析与最有效率的Java程序的开发有机地结合起来，深入分析每种算法，并细致讲解精心构造程序的方法，内容全面、缜密严格。
第3版的主要更新如下：
第4章包含AVL树删除算法的实现。
第5章进行了全面修订和扩充，现在包含两种较新的算法-cuckoo散列和hopscotch散列。
第7章包含基数排序的相关内容，并给出了下界证明。
第12章增加了后缀树和后缀数组的相关材料，包括Karkkainen和Sanders的线性时间后缀数组构造算法。
更新书中的代码，使用了Java 7中的菱形运算符。
《数据结构与算法分析Java语言描述(英文版?第3版)》
Chapter 1 Introduction
1.1 What's the Book About?
1.2 Mathematics Review
1.3 A Brief Introduction to Recursion
1.4 Implementing Generic Components Pre-Java 5
1.5 Implementing Generic Components Using Java 5 Generics
1.6 Function Objects
Chapter 2 Algorithm Analysis
2.1 Mathematical Background
2.3 What to Analyze
2.4 Running Time Calculations
Chapter 3 Lists, Stacks, and Queues
3.1 Abstract Data Types (ADTs)
3.2 The List ADT
3.3 Lists in the Java Collections API
3.4 Implementation of ArrayList
3.5 Implementation of LinkedList
　　Purpose/Goals
　　This new Java edition describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be
feasible. For example, in this text students look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from centuries to less than a second. Therefore, no algorithm or data structure is presented without an explanation of its running time. In some cases, minute details that affect the running time of the implementation are explored.
　　Once a solution method is determined, a program must still be written. As computers have become more powerful, the problems they must solve have become larger and more complex, requiring development of more intricate programs. The goal of this text is to teach students good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency.
　　This book is suitable for either an advanced data structures (CS7) course or a first-year graduate course in algorithm analysis. Students should have some knowledge of intermedi-ate programming, including such topics as object-based programming and recursion, and some background in discrete math.
　　Summary of the Most Significant Changes in the Third Edition
　　The third edition incorporates numerous bug fixes, and many parts of the book have undergone revision to increase the clarity of presentation. In addition,
　　Chapter 4 includes implementation of the AVL tree deletion algorithm--a topic often requested by readers.
　　Chapter 5 has been extensively revised and enlarged and now contains material on two newer algorithms: cuckoo hashing and hopscotch hashing. Additionally, a new section on universal hashing has been added.
　　Chapter 7 now contains material on radix sort, and a new section on lower bound proofs has been added.
　　Chapter 8 uses the new union/find analysis by Seidel and Sharir, and shows.the O( Md(M, N) ) bound instead of the weaker O( Mlog* N ) bound in prior editions.
　　Chapter 12 adds material on suffix trees and suffix arrays, including the linear-time suffix array construction algorithm by Karkkainen and Sanders (with implementation). The sections covering deterministic skip lists and AA-trees have been removed.
　　Throughout the text, the code has been updated to use the diamond operator from Java 7.
　　Approach
　　Although the material in this text is largely language independent, programming requires the use of a specific language. As the title implies, we have chosen Java for this book.
　　Java is often examined in' comparison with C++. Java offers many benefits, and pro-grammers often view Java as a safer, more portable, and easier-to-use language than C++.As such, it makes a fine core language for discussing and implementing fundamental data structures. Other important parts of Java, such as threads and its GUI, although important,are not needed in this text and thus are not discussed.
　　Complete versions of the data structures, in both Java and C++, are available on the Internet. We use similar coding conventions to make the parallels between the two languages more evident.
　　Overview
　　Chapter 1 contains review material on discrete math and recursion. I believe the only way to be comfortable with recursion is to see good uses over and over. Therefore, reCursion is prevalent in this text, with examples in every chapter except Chapter 5. Chapter i also presents material that serves as a review of inheritance in Java. Included is a discussion of Java generics.
　　Chapter 2 deals with algorithm analysis. This chapter explains asymptotic analysis and its major weaknesses. Many examples are provided, including an in-depth explanation of logarithmic running time. Simple recursive programs are analyzed by intuitively converting them into iterative programs. More complicated divide-and-conquer programs are intro-duced, but some of the analysis (solving recurrence relations) is implicitly delayed until Chapter 7, where it is performed in detail.
　　Chapter 3 covers lists, stacks, and queues. This chapter has been significantly revised from prior editions. It now includes a discussion of the Collections APl ArrayList and LinkedLi st classes, and it provides implementations of a significant subset of the collections APl ArrayLi st and Li nkedLi st classes.
　　文艺复兴以降，源远流长的科学精神和逐步形成的学术规范，使西方国家在自然科学的各个领域取得了垄断性的优势；也正是这样的传统，使美国在信息技术发展的六十多年间名家辈出、独领风骚。在商业化的进程中，美国的产业界与教育界越来越紧密地结合，计算机学科中的许多泰山北斗同时身处科研和教学的最前线，由此而产生的经典科学著作，不仅擘划了研究的范畴，还揭示了学术的源变，既遵循学术规范，又白有学者个性，其价值并不会因年月的流逝而减退。
　　近年，在全球信息化大潮的推动下，我国的计算机产业发展迅猛，对专业人才的需求日益迫切。这对计算机教育界和出版界都既是机遇，也是挑战；而专业教材的建设在教育战略上显得举足轻重。在我国信息技术发展时间较短的现状下，美国等发达国家在其计算机科学发展的几十年间积淀和发展的经典教材仍有许多值得借鉴之处。因此，引进一批国外优秀计算机教材将对我国计算机教育事业的发展起到积极的推动作用，也是与世界接轨、建设真正的世界一流大学的必由之路。
　　机械工业出版社华章公司较早意识到“出版要为教育服务”。自1998年开始，我们就将工作重点放在了遴选、移译国外优秀教材上。经过多年的不懈努力，我们与Pcarson。McGraw-Hill，Elsevier，MIT，John Wiley&Sons，Cengage等世界著名出版公司建立厂良好的合作关系，从他们现有的数百种教材中甄选出Andrew S．Tanenbanm，Biame Stroustrup，Brain w Kemighan，Dennis Ritchie，Jim Gray，Afred V Aho。John E．Hopcroft．Jeffrey D．Ullman，Abraham Silberschatz，William Stallings，Donald E．Knuth．John L．Hennessy，Larry L．Peterson等大师名家的一批经典作品，以“计算机科学丛书”为总称出版，供读者学习、研究及珍藏。大理石纹理的封面，也正体现了这套丛书的品位和格调。
　　“计算机科学丛书”的出版工作得到了国内外学者的鼎力襄助，国内的专家不仅提供了中肯的选题指导，还不辞劳苦地担任了翻译和审校的工作；而原书的作者也相当关注其作品在中国的传播，有的还专程为其书的中译本作序。迄今，“计算机科学丛书”已经出版了近两百个品种，这些书籍在读者中树立了良好的口碑，并被许多高校采用为正式教材和参考书籍。其影印版“经典原版书库”作为姊妹篇也被越来越多实施双语教学的学校所采用。
　　权威的作者、经典的教材、一流的译者、严格的审校、精细的编辑，这些因素使我们的图书有了质量的保证。随着计算机科学与技术专业学科建设的不断完善和教材改革的逐渐深化，教育界对国外计算机教材的需求和应用都将步入一个新的阶段，我们的目标是尽善尽美，而反馈的意见正是我们达到这一终极目标的重要帮助。华章公司欢迎老师和读者对我们的工作提出建议或给予指正，我们的联系方法如下：
　　华章网站：www．hzbook．com
　　电子邮件：hzjsj@hzbook．com
　　联系电话：(010)
　　联系地址：北京市西城区百万庄南街1号
　　邮政编码：100037
系列图书推荐 ￥139.00￥104.25
同类热销商品￥30.00￥21.00
订单处理配送
北京奥维博世图书发行有限公司 china-pub,All Rights Reserved