A Multigrid Tutorial-William L. Briggs--second edition
2022-11-03 14:55:25
19.33MB
1
Stephen L. Campbell, Jean-Philippe Chancelier
and Ramine N ikoukhah
Modeling and Simulation
in Scilab/Scicos with
ScicosLab 4 .4
Second Edition
2022-11-02 22:18:31
6.44MB
1
Schaum's Outline of Probability and Statistics, Third Edition 2009.pdf
2022-11-01 22:40:22
8.99MB
1
Numerical Recipes in C- The Art of Scientific Computing, 2nd Edition + source_code
2022-11-01 21:23:14
9.68MB
1
The Official (ISC)2 CCSP CBK Reference Third Edition英文版
2022-11-01 18:00:12
1.48MB
1
Introduction to Algorithms, Second Edition
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein ISBN:0262032937
The MIT Press © 2001 (1180 pages)
A course in computer algorithms, suitable for use as a field reference for working software developers.
Table of Contents
Introduction to Algorithms, Second Edition
Preface
Part I - Foundations
Chapter 1 - The Role of Algorithms in Computing
Chapter 2 - Getting Started
Chapter 3 - Growth of Functions
Chapter 4 - Recurrences
Chapter 5 - Probabilistic Analysis and Randomized Algorithms
Part II - Sorting and Order Statistics
Chapter 6 - Heapsort
Chapter 7 - Quicksort
Chapter 8 - Sorting in Linear Time
Chapter 9 - Medians and Order Statistics
Part III - Data Structures
Chapter 10 - Elementary Data Structures
Chapter 11 - Hash Tables
Chapter 12 - Binary Search Trees
Chapter 13 - Red-Black Trees
Chapter 14 - Augmenting Data Structures
Part IV - Advanced Design and Analysis Techniques
Chapter 15 - Dynamic Programming
Chapter 16 - Greedy Algorithms
Chapter 17 - Amortized Analysis
Part V - Advanced Data Structures
Chapter 18 - B-Trees
Chapter 19 - Binomial Heaps
Chapter 20 - Fibonacci Heaps
Chapter 21 - Data Structures for Disjoint Sets
Part VI - Graph Algorithms
Chapter 22 - Elementary Graph Algorithms
Chapter 23 - Minimum Spanning Trees
Chapter 24 - Single-Source Shortest Paths
Chapter 25 - All-Pairs Shortest Paths
Chapter 26 - Maximum Flow
Part VII - Selected Topics
Chapter 27 - Sorting Networks
Chapter 28 - Matrix Operations
Chapter 29 - Linear Programming
Chapter 30 - Polynomials and the FFT
Chapter 31 - Number-Theoretic Algorithms
Chapter 32 - String Matching
Chapter 33 - Computational Geometry
Chapter 34 - NP-Completeness
Chapter 35 - Approximation Algorithms
Part VIII - Appendix: Mathematical Background
Appendix A - Summations
Appendix B - Sets, Etc.
Appendix C - Counting and Probability
Bibliography
Index
List of Figures
List of Corollaries
List of Problems
List of Exercises
2022-10-31 23:16:45
17.88MB
1
卡通填色游戏Drawing Coloring Extra Edition 1.09.rar
2022-10-28 09:07:15
6.61MB
Web资源分析方法方法和技术，挖掘超链接，内容以及用户数据
2022-10-25 16:34:23
10.93MB
1