图解算法
电子书推荐
-
算法导论 英文原版(pdf) 评分:
本人找了好久才发现的,英文原版,《算法导论》 计算机专业经典书籍 pdf格式 非常清晰 欢迎大家下载评论
上传时间:2010-12 大小:397KB
- 17.88MB
算法导论英文版
2012-08-01算法导论,英文 【本书目录】 I Foundations Introduction 3 l The Role of Algorithms in Computing 5 l.l Algorithms 5 l.2 Algorithms as a technology 10 2 Getting Started I5 2.l Insertion sort 15 2.2 Analyzing algorithms 21 2.3 Designing algorithms 27 3 Growth of Functions 41 3.l Asymptotic notation 41 3.2 Standard notations and common functions 51 4 Recurrences 62 4.l The substitution method 63 4.2 The recursion-tree method 67 4.3 The master method 73 4.4 Proof of the master theorem 76 5 Probabilistic Analysis and Randomized Algorithms 5.l The hiring problem 91 5.2 Indicator random variables 94 5.3 Randomized algorithms 99 5.4 Probabi1istic analysis and further uses of indicator 106 II Sorting and Order Statistics Introduction 123 6 Heapsort 127 6.l Heaps I27 6.2 Maintaining the heap property 130 6.3 Building a heap 132 6.4 The heapsort algorithm 135 6.5 Priority queues 138 7 Quicksort 145 7.l Description of quicksort 145 7.2 Performance ofquicksort 149 7.3 A randomized version of quicksort 153 7.4 Analysis ofquicksort 55 8 Sorting in Linear Time 165 8.l Lower bounds for sorting 165 8.2 Counting sort i68 8.3 Radix sort 170 8.4 Bucket sort 174 9 Medians and Order Statistics 183 9.1 Minimum and maximum 184 9.2 Selection in expected linear time 185 9.3 Selection in worst-case linear time 189 III Data Structures Introduction 197 10 Elementary Data Structures 200 l0.l Stacks and queues 200 l0.2 Linked lists 204 l0.3 Implementing pointers and objects 209 l0.4 Representing rooted trees 214 11 Hash Tables 221 ll.l Direct-address tables 222 11.2 Hash tables 224 ll.3 Hash functions 229 ll.4 Open addressing 237 ll.5 Perfect hashing 24S l2 Binary Search Trees 253 l2.l What is a binary search tree? 2S3 l2.2 Querying a binary search tree 2S6 l2.3 Insertion and deletion 261 l2.4 Randoinly built binary search trees 265 13 Red-Black Thees 273 l3.l Properties of red-black trees 273 l3.2 Rotations 277 l3.3 Insertion 280 l3.4 Deletion 288 14 Augmenting Data Structures 302 l4.l Dynamic order statistics 302 l4.2 How to augment a data structure 308 l4.3 Interval trees 311 IV Advanced Desthe and Analysis Techniques Introduction 321 15 Dynamic Programming J2J l5.l Assembly--line scheduling 324 l5.2 Matrix-chain multiplication 331 l5.3 Elements of dynamic programming 339 15.4 Longest common subsequence 350 l5.5 Optimal binary search trees 356 l6 Greedy Algorithms 370 l6.l An activity-selection problem 371 l6.2 Elements of the greedy strategy 379 l6.3 Huffman codes 385 l6.4 Theoretical foundations for greedy methods 393 16.5 A task-scheduling problem 399 17 Amortized Analysis 405 l7.1 Aggregate analysis 406 17.2 The accounting method 410 17.3 The potential method 412 l7.4 Dynamic tables 416 V Advanced Data Structures Introduction 431 18 B-Trees 434 18.l Definition of B--trees 438 l8.2 Basic operations on B-trees 44j l8.3 Deleting a key from a B--tree 449 19 Binomial Heaps 455 l9.l Binomial trees and binomial heaps 457 19.2 Operations on binomial heaps 461 20 Fibonacci Heaps 476 20.l Structure of Fibonacci heaps 477 20.2 Mergeable-heap operations 479 20.3 Decreasing a key and deleting a node 489 20.4 Bounding the maximum degree 493 21 Data Structures for Disjoint Sets 498 2l.l Disjoint--set operations 498 2l.2 Linked-list representation of disjoint sets 501 2l.3 Disjoint--set forests 505 2l.4 Analysis of union by rank with path compression 50 VI Graph Algorithms Introduction 525 22 Elementary Graph Algorithms 527 22.l Representations of graphs 527 22.2 Breadth-first search 531 22.3 Depth-first search 540 22.4 Topological sort 549 22.5 Strongly connected components 552 23 Minimum Spanning Trees 561 23.l Growing a minimum spanning tree 562 23.2 The algorithms of Kruskal and Prim 567 24 Single-Source Shortest Paths 580 24.l The Bellman-Ford algorithm 588 24.2 Single-source shortest paths in directed acyclic graphs 24.3 Dijkstra's algorithm 595 24.4 Difference constraints and shortest paths 601 24.5 Proofs of shortest-paths properties 607 25 All-Pairs Shortest Paths 620 25.l Shortest paths and matrix multiplication 622 25.2 The Floyd-Warshall a1gorithm 629 25.3 Johnson's algorithm for sparse graphs 636 26 Maximum Flow d43 26.l Flow networks 644 26.2 The Ford-Fulkerson method 651 26.3 Maximum bipartite matching 664 26.4 Push--relabel algorithms 669 26.5 The relabel--to-front a1gorithm 68I VII Selected Topics Introduction 701 27 Sorting Networks 704 27.l Comparison networks 704 27.2 The zero-one principle 709 27.3 A bitonic sorting network 712 27.4 A merging network 716 27.5 A sorting network 719 28 Matrix Operations 725 28.l Properties of matrices 725 28.2 Strassen's algorithm for matrix multiplication 735 28.3 Solving systems of linear equations 742 28.4 Inverting matrices 7S5 28.5 Symmetric positive-definite matrices and least-squares approximation760 29 Linear Programming 770 29.1 Standard and slack forms 777 29.2 Formulating problems as linear programs 785 29.3 The simplex algorithm 790 29.4 Duality 804 29.5 The initial basic feasible solution 811 30 Polynomials and the FFT 822 30.l Representation of polynomials 824 30.2 The DFT and FFT 830 30.3 Efficient FFT implementations 839 31 Number-Theoretic Algorithms 849 3l.l E1ementary numbertheoretic notions 850 31.2 Greatest common divisor 856 3l.3 Modular arithmetic 862 3l.4 Solving modular linear equations 869 3l.5 The Chinese remainder theorem 873 3l.6 Powers of an element 876 3l.7 The RSA public-key cryptosystem 881 3l.8 Primality testing 887 3l.9 Integer factorization 896 32 String Matching 906 32.l The naive string-matching algorithm 909 32.2 The Rabin-Karp algorithm 911 32.3 String matching with finite automata 916 32.4 The Knuth-Morris-Pratt algorithm 923 33 Computational Geometry 933 33.l Line--segment properties 934 33.2 Determining whether any pair of segments intersects 940 33.3 Finding the convex hull 947 33.4 Finding the c1osest pair of points 957 34 NP-Completeness 966 34.1 Polynomial time 971 34.2 Polynomial-time verification 979 34.3 NP-completeness and reducibility 984 34.4 NP--completeness proofs 995 34.5 NP-complete problems 1003 35 Approximation Algorithms 1022 35.l The vertex-cover problem 1024 35.2 The traveling-salesman problem 1027 35.3 The set-covering problem 1033 35.4 Randomization and linear programming ]039 35.5 The subset-sum problem 1043 VH APPendir: Mathematical Background Introduction 1057 A Summations 1058 A.l Summation formulas and properties 1058 A.2 Bounding summations 1062 B Sets, Etc. 1070 B.1 Sets 1070 B.2 Relations 1075 B.3 Functions 1077 B.4 Graphs 1080 B.5 Trees 1085 C Counting and Probability 1094 C.l Counting 1094 C.2 Probability 1100 C.3 Discrete random variables 1106 C.4 The geometric and binomial distributions 1112 C.5 The tails of the binomial distribution 1118 Bibliography 1127 Index 1145
- 0B
算法导论(英文原版教材).pdf
2022-12-02算法导论(英文原版教材).pdf
- 14.52MB
算法导论答案第四版英文版
2018-10-29算法导论答案,第四版,但是是英文版的。
- 11.70MB
算法 英文版第4版.pdf
2019-01-18算法 英文版第4版.pdf
- 5.38MB
算法导论(英文版)
2018-10-31算法是程序的灵魂。本书是算法原版书籍,内容包含了数论,数据结构,算法高级设计,图算法等等常见问题。
- 8.72MB
算法导论 英文原版
2015-10-12英文版 算法导论 第三版 高清pdf版本
- 4.84MB
算法导论英文原版(第三版)
2011-05-09算法导论的英文原版,pdf格式,非图片,最清晰版
- 4.84MB
算法导论英文原版第三版
2014-03-04经典的算法教材,英文原版第三版,高清pdf。
- 257KB
《算法导论》习题答案PDF格式
2010-01-27《算法导论》习题答案,由Philip Bille完成,英文原版。PDF格式
- 261KB
《算法导论》原版英文课件5
2012-07-23Lecture 5 Linear-time Sorting Lower Bounds, Counting Sort, Radix Sort.pdf
- 4.86MB
算法导论英文版(Introduction to Algorithms, 3rd Edition)
2018-12-10算法导论的经典教材,各种算法。中文翻译版的不是很好。
- 4.84MB
算法导论(英文第四版)非扫描
2012-12-16算法的经典教材,英文版的,而且是非扫描版的 ,非常清晰。
- 12.53MB
算法导论(英文原版)
2010-07-15关于算法的经典之作。唯一的缺陷是英文版的,pdf格式。
- 12.93MB
算法导论英文版+答案
2015-04-15算法导论的英文版加上答案 [Instructor's Manual]就是答案
- 4.56MB
[算法导论]原版第三版
2013-04-24[算法导论]原版第三版
- 422KB
《算法导论》原版英文课件6
2012-07-23Lecture 6 Order Statistics, Median.pdf
- 10.0MB
麻省理工学院算法导论(中英文版包括原版教材、上课笔记、测试、课后作业等)part1
2008-10-18《算法导论》将严谨性和全面 性融为一体。.. 本书深入讨论各类算法,并着力使这些算法的设计和分析能为各个层次的读者接受。各章自成体系,可以作为独立的学习单元。算法 以英语和伪代码的形式描述,具备初步程序...
- 260KB
算法导论(英文版)(part1)
2010-01-02《算法导论》(英文原版)pdf格式,分三部分上传
- 5.38MB
算法导论 第三版 英文原版 高清文字版
2014-04-25Introduction to Algorithms Third Editio Contents I Foundations Introduction 3 1 The Role of Algorithms in Computing 5 1.1 Algorithms 5 1.2 Algorithms as a technology 11 2 Getting Started 16 ...
- 257KB
算法导论(英文版)(part3)
2010-01-02《算法导论》(英文原版)pdf格式,分三部分上传
- 5.3MB
Introduction to Algorithms 3rd
2019-02-26《Introduction to Algorithms》译作《算法导论》,是由Thomas H.Cormen, Charles E.Leiserson 等人编写的十分经典的计算机算法书籍。本书以相当的深度介绍了许多常用的数据结构和有效的算法,使得这些算法的设计和分析易于被各个层次的读者所理解。本书被china-pub会员评为“2007年我最喜爱的十大技术图书”之一,被《程序员》等机构评选为2006年最受读者喜爱的十大IT图书之一
- 8.53MB
王者荣耀源代码,,
2018-01-09王者荣耀源代码,, 不包含资源,只有源码,, 王者荣耀源代码,, 不包含资源,只有源码,,
- 3KB
算法导论第五章习题解答
2015-08-13能用代码表示的都用代码表示,不能表示的写出思路,思路都没写的就是我也做不出来
- 33.26MB
算法导论(中文版)
2015-08-15Thomas H.Cormen的MIT经典教材,第二版,中文版
- 758KB
算法导论.epub
2017-09-17本书深入浅出,全面地介绍了计算机算法。对每一个算法的分析既易于理解又十分有趣,并保持了数学严谨性。本书的设计目标全面,适用于多种用途。涵盖的内容有:算法在计算中的作用,概率分析和随机算法的介绍。本书专门讨论了线性规划,介绍了动态规划的两个应用,随机化和线性规划技术的近似算法等,还有有关递归求解、快速排序中用到的划分方法与期望线性时间顺序统计算法,以及对贪心算法元素的讨论。本书还介绍了对强连通子图算法正确性的证明,对哈密顿回路和子集求和问题的NP完全性的证明等内容。全书提供了900多个练习题和思考题以及叙述较为详细的实例研究。
- 12.71MB
算法导论 原版 第二版
2016-05-29算法导论,原版,第二版,是英文版!包括清晰的PDF和WORD,里面有更新勘误和习题解答,推荐!
- 12.48MB
算法导论(英文版)(part2)
2010-01-02《算法导论》(英文原版)pdf格式,分三部分上传
- 4.84MB
算法导论(英文)第三版
2014-05-25算法导论第三版英文原版,pdf格式的,免积分下载。
- 300KB
《算法导论》原版英文课件12
2012-07-23Lecture 12 Skip Lists.pdf
- 223KB
《算法导论》原版英文课件7
2012-07-23Lecture 7 Hashing, Hash Functions.pdf