算法:第4版(Algorithms, 4th Edition)

所需积分/C币:9 2016-02-29 22:03:52 33.03MB PDF
14
收藏 收藏
举报

算法:第4版(Algorithms, 4th Edition)
Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks Where those designations appear in this book, and the publisher was aware of a trademark claim, the designations have been printed with initial capital letters or in all capitals The authors and publisher have taken care in the preparation of this book but make no expressed or implied warranty of any kind and assume no responsibility for errors or omissions. No liability is assumed for incidental or consequential damages in connection with or arising out of the use of the in formation or programs contained herein he publisher offers excellent discounts on this book when ordered in quantity for bulk purchases or special sales, which may include electronic versions and/or custom covers and content particular to your business training goals, marketing focus, and branding interests. For more information, please contact U.S. Corporate and government sales (800)382-3419 corpsalesapearsontechgroup.com For sales outside the United States, please contact International sales international(@pearson.com Visit us on the web informit. com/aw Library of Congress Cataloging-in-Publication Data Sedgewick, robert, 1946 Algorithms /Robert Sedgewick, Kevin Wayne.4th ed p cm Includes index isBn978-0-321-57351-3(hardcover: alk. paper)1. Computer algorithms Textbooks I. Wayne. Kevin Daniel, 1971-Il. Title QA76.9A43S4292011 005.1-dc22 2011000707 Copyrightc 201 1 Pearson Education, Inc All rights reserved. Printed in the United States of America. This publication is protected by copyright, and permission must be obtained from the publisher prior to any prohibited reproduction, storage in a retrieval system, or transmission in any form or by any means, electronic mechanical, photocopying, recording, or likewise. For information regarding permissions, write to ISBN-13:978-0-321-57351-3 ISBN-10:0-321-57351X Text printed in the United States on recycled paper at Courier in Westford, Massachusetts Second printing, January 2012 To Adam, Andrew, Brett, Robbie and especially L To Jackie and alex Contents preface 1 Fundamentals 1.1 Basic Programming Model Primitive data types Loops and conditionals Ar Static methods Recursion APIS Strings Input and output Binary search 1.2 Data abstraction Objects Abstract data types Implementing ADTs Designing aDts 1.3 Bags. Queues, and Stacks APls Arithmetic expression evaluation Resizing arrays Generics Iterators Linked lists 1.4 Analysis of Algorithms Running time Computational experiments Tilde notation Order-ofgrowth classifications Amortized analysis emory usage 5 Case Study: Union-Find Dynamic connectivity Quick find Quick union Weighted quick union 2 Sorting 2.1 Elementary Sorts Rules of the game Selection sort Insertion sort Shellsort 2.2 Mergesort Abstract in-place merge Top-down mergesort Bottom-up mergesort Nlg N lower bound for sorting 2.3 Quicksort In-place partitioning Randomized quicksort 3-way partitioning 2.4 Priority queues Priority queue apl Elementary implementations Binary heap Heapsort 2.5 Applications Comparators Stability Median and order statistics 3 Searching 3.I Symbol tables Symbol table apl Ordered symbol table Apl D eau Frequency counter Sequential search Binary search 3.2 Binary Search Trees Basic implementation Order-based methods Deletion 3.3 Balanced search trees 2-3 search trees Red-black bsts Deletion 3. 4 Hash tables Hash functions Separate chaining Linear probing 3.5 Applications Set data type Whitelist and blacklist filters Dictionary lookup Inverted index File indexing Sparse matrix-vector multiplication 4 Graphs 4.1 Undirected Graphs Glossary Undirected graph type Adjacency-lists representation Depth-first search Breadth-first search Connected components Degrees of separation 4.2 Directed Graphs Glossary Digraph data type Depth-first search Directed cycle detection Precedence-constrained schedulin Topological sort Strong connectivity Kosaraju-Sharir algorithm Transitive closure 4.3 Minimum Spanning Trees ut property GE greedy algorithm Edge-weighted graph data type Prim's algorithm Kruskal's algorithm 4.4 Shortest paths Properties of shortest paths Edge-weighted digraph data types Generic shortest paths algorithm Dijkstra's algorithm Shortest paths in edgeweighted dAgs Critical-path method Bellman-Ford algorithm Negative cycle detection Arbitrage 5 Strings

...展开详情
试读 127P 算法:第4版(Algorithms, 4th Edition)
立即下载 身份认证后 购VIP低至7折
一个资源只可评论一次,评论内容不能少于5个字
您会向同学/朋友/同事推荐我们的CSDN下载吗?
谢谢参与!您的真实评价是我们改进的动力~
上传资源赚钱or赚积分
最新推荐
算法:第4版(Algorithms, 4th Edition) 9积分/C币 立即下载
1/127
算法:第4版(Algorithms, 4th Edition)第1页
算法:第4版(Algorithms, 4th Edition)第2页
算法:第4版(Algorithms, 4th Edition)第3页
算法:第4版(Algorithms, 4th Edition)第4页
算法:第4版(Algorithms, 4th Edition)第5页
算法:第4版(Algorithms, 4th Edition)第6页
算法:第4版(Algorithms, 4th Edition)第7页
算法:第4版(Algorithms, 4th Edition)第8页
算法:第4版(Algorithms, 4th Edition)第9页
算法:第4版(Algorithms, 4th Edition)第10页
算法:第4版(Algorithms, 4th Edition)第11页
算法:第4版(Algorithms, 4th Edition)第12页
算法:第4版(Algorithms, 4th Edition)第13页
算法:第4版(Algorithms, 4th Edition)第14页
算法:第4版(Algorithms, 4th Edition)第15页
算法:第4版(Algorithms, 4th Edition)第16页
算法:第4版(Algorithms, 4th Edition)第17页
算法:第4版(Algorithms, 4th Edition)第18页
算法:第4版(Algorithms, 4th Edition)第19页
算法:第4版(Algorithms, 4th Edition)第20页

试读结束, 可继续阅读

9积分/C币 立即下载