: Network Disk Download
Content introduction Edit data structure and algorithm analysis: C language Description (Original book 2nd edition) of the content: The book introduces the current popular topics and new changes in detail, discusses the algorithm design skills, and in the study of the performance of the algorithm, efficiency and analysis of the running time based on a number of high-level data structures, From the historical point of view and recent progress, the active field of data structure is briefly summarized. Because of the data structure and algorithm analysis: C language Description (the original book 2nd edition), the selection of novel, practical method, rich examples, the choice is appropriate. "Data structure and algorithm analysis: C language Description (Original book 2nd edition)" Is the purpose of training students good programming skills and skilled algorithm analysis ability, so that they can develop a high-efficiency program. From the service to practice and exercise students practical ability, the book provides a large algorithm of C program and pseudo code routines, but not all. Some programs can be obtained from the Internet. "Data structure and algorithm analysis: C language Description (Original book 2nd edition)" is the "data structures and algorithm analyses in C" a simplified Chinese version of the book 2nd. The original book was named one of the top 30 computer works of the 20th century, and the author Mark Allen Weiss has made a contribution to data structure and algorithmic analysis, and his work in the field of the analysis of statistics and algorithms has been particularly popular and widely praised. It has been used as teaching material by more than 500 universities around the world. In the data structure and algorithm analysis: C language Description (the 2nd edition of the original book), the author more refined and strengthened his algorithm and data structure of innovative processing methods. Through the implementation of C program, the concept of abstract data type is emphatically expounded, and the efficiency, performance and running time of the algorithm are analyzed. The book features the following: Dedicated chapter to discuss algorithmic design techniques, including greedy algorithm, divide and conquer algorithm, dynamic programming, randomization algorithm and backtracking algorithm introduced the current popular topics and new data structure, such as Fibonacci heaps, oblique heap, two queue, jumping table and stretching tree arrangement chapter devoted to the analysis of amortization, Some of the high-level data structures introduced in the examination book are a new chapter that discusses the high-level structure and their implementation, including red-black trees, top-down stretching trees. Treap tree, k-d tree, paired heap, and other related content combined with some new results of the average analysis of heap ordering data structure and algorithm analysis: C language Description (Original book 2nd edition) is a foreign data structure and algorithm analysis of the standard teaching material, introduced the data structure (large amount of data organization method) and algorithm analysis (estimate of the algorithm run time). "Data structure and algorithm analysis: C language Description (Original book 2nd edition)" The writing goal is simultaneously teaches the good program design and the algorithm analysis skill, enables the reader to develop has the most high efficiency the procedure. "Data structure and algorithm analysis: C language Description (Original book 2nd edition)" Can be used as advanced data structure courses or postgraduate first-year algorithm analysis course textbooks, using the data structure and algorithm analysis: C Language Description (Original book 2nd edition) "Need to have some intermediate programming knowledge, but also need some background knowledge of discrete mathematics." [1]Author Profile Editor (US): Feng Sun Mark Allen Weiss is a professor of computer science at the Florida International University, Ph. D., Princeton University. In addition to this book, he has written about data structures and algorithms in the well-known textbooks: Data structures and algorithm analysis:in Java, data structures and Algonthm analysis:in C + + to and data structures and problem solving:using Jave, data struchures and problem solving:using C + +, etc. He is currently the chairman of the AP Test computer Discipline Committee. He is currently a professor at the College of Computing and Information Science at Florida International University. He has served as chairman of the Placement (advanced) Examinations Computer Discipline Committee (2000-2004). His main research interests are data structures, algorithms, and pedagogy.[1]Introduction to the 1th chapter of catalogue editing
1. 1 What the book discusses
1. 2 Review of Mathematical knowledge
1. 2. 1 index
1. 2. 2 logarithm
1. 2. Number of levels 3
1. 2. 4 modulo operation
1.2. 5 Proof method
1. A brief discussion on recursion of 3
Summarize
Practice
Reference documents
The 2nd Chapter algorithm analysis
2. 1 Fundamentals of Mathematics
2. 2 Models
2. 3 Issues to analyze
2. 4 Run Time Calculation
2. 4. 11 Simple examples
2. 4. 2 General rules
2. 4. 3 Maximum sub-sequence and solution of the problem
.2. 4. 4 logarithm in run time
2. 4. 5 Test Your analysis
2. 4. 6 accuracy of the analysis results
Summarize
Practice
Reference documents
3rd chapter tables, stacks, and queues
3. 1 abstract data type (ADT)
3. 2 Table ADT
3. 2. 1 simple array implementations of tables
3. 2. 2 Linked List
3. 2. 3 Programming Details
3. 2. 4 Common Mistakes
3. 2. 5 Double Linked list
3. 2. 6 Circular Link List
3. 2. 7 examples
3. 2. 8 cursor implementations of linked lists
3. 3 Stack ADT
3. 3. 1 Stack model
3. 3. Implementation of the 2 stack
3. 3. 3 Applications
3. 4 Queue ADT
3. 4. 1 Queue Model
3. 4. 2 Array implementations of queues
3. 4. 3 Application of queues
Summarize
Practice
4th Chapter Tree
4. 1 Preliminary knowledge
4. 1. 1 Implementation of the tree
4. 1. The traversal and application of 2 trees
4. 22 Fork Tree
4. 2. 1 implementation
4. 2. 2 expression tree
4. 3 Find tree adt--two fork find tree
4. 3. 1 Makeempty
4. 3. 2 Find
4. 3. 3 Findmin and Findmax
4. 3. 4 Insert
4. 3. 5 Delere
4. 3. 6 Average Situation Analysis
4. 4 AVL Trees
4. 4. 1 single rotation
4. 4. 2 Dual rotation
4. 5 Stretching trees
4. 5. 11 Simple Ideas
4. 5. 2 Expand
4. 6 Traversal of the tree
4. 7 B-Tree
Summarize
Practice
Reference documents
5th Chapter Hash
5. 1 General Ideas
5. 2 hash function
5. 3 Separate link method
5. 4 Open Addressing method
5. 4. 1 Linear detection method
5. 4. 2 Square Probe method
5. 4. 3 Double Hash
5. 5 Re-hash
5. 6 Diffuser Column
Summarize
Practice
Reference documents
6th Priority Queue (heap)
6. 1 Models
6. 2 Some simple implementations
6. 32 Fork Pile
6. 3. 1 Structural properties
6. 3. 2 Sequencing Properties
6. 3. 3 Basic heap Operations
6. 3. 4 Other heap operations
6. 4 Application of Priority queue
6. 4. 1 Selection Questions
6. 4. 2 Event Simulation
6. 5 D-Heap
6. 6 left-hand heap
6. 6. 1 properties of the left-hand heap
6. 6. 2 operation of the left-hand heap
6. 7 Oblique Heap
6. 82 Items Queue
6. 8. 12-Item Queue structure
6. 8. 22-Item Queue operation
6. 8. Implementation of the 32-item queue
Summarize
Practice
Reference documents
7th Chapter Sort
7. 1 Preliminary knowledge
7. 2 Insert Sort
7. 2. 1 algorithm
7. 2. 2 Parsing of Insert sort
7. 3 lower bounds for some simple sorting algorithms
7.4 Hill Sort
7. 4. 1 worst case analysis of Hill sequencing
7. 5 Heap Sorting
7. 5. 1 Analysis of heap sequencing
7. 6 Merge Sort
7. 6. 1 Analysis of merge sort
7. 7 Quick Sort
7. 7. 1 Pivot Element Selection
7. 7. 2 Segmentation Strategy
7. 7. 3 decimal Groups
7. 7. 4 Actual Quick Sort Routines
7. 7. 5 Analysis of Fast sequencing
7. 7. 6 selection of linear expected time algorithm
7. 8 Sorting of large structures
7. 9 General lower bounds for sorting
7. 9. 1 Decision Tree
7. 10 barrel Sequencing
7. 11 External sorting
7. 11. 1 Why new algorithms are needed
7. 11. 2 external Sort model
7. 11. 3 Simple algorithms
7. 11. 4 Multi-Channel merging
7. 11. More than 5 in consistency and
7. 11. 6 Replace Selection
Summarize
Practice
Reference documents
8th Chapter Disjoint Set ADT
8. 1 equivalence relation
8. 2 Dynamic equivalence problems
8. 3 Basic Data Structures
8. 4 dexterous algorithm
8. 5 path compression
8. 6 Worst case scenario by rank and path compression
8. 6. 1 Union/find Algorithm Analysis
8. 71 Applications
Summarize
Practice
Reference documents
The 9th Chapter graph theory algorithm
9. 1 Some definitions
9. 1. 1 Representation of graphs
9. 2 topology sequencing
9. 3 Shortest Path algorithm
9. 3. 1 Not authorized Shortest path
9. 3. 2 Dijkstra algorithm
9. 3. 3 graphs with negative boundary values
9. 3. 4 No Circle diagram
9. 3. 5 a bit to the shortest path
9. 4 Network flow problems
9. 4. 11 Simple maximum flow algorithms
9. 5 minimum Spanning Tree
9. 5. 1 Prim algorithm
9. 5. 2 Kruskal algorithm
9. 6 Application of Depth-first search
9. 6. 1 graph without direction
9. 6. 2 Dual Connectivity
9. 6. 3 Euler circuit
9. 6. 4 direction diagram
9. 6. 5 Finding strong branches
9. 7 Introduction of np-complete
9. 7. 1 Difficult and easy
9. 7. 2 NP Class
9. 7. 3 np-Complete question
Summarize
Practice
Reference documents
The 10th chapter algorithm design Skill
10. 1 Greedy algorithm
10. 1. 11 Simple scheduling problems
10. 1. 2 Huffman encoding
10. 1. 3 Approximate boxing problem
10. 2 Divide-and-conquer algorithm
10. 2. 1 run time of the divide-and-conquer algorithm
10. 2. 2 Recent Point issues
10. 2. 3 Selection Questions
10. 2. 4 theoretical improvement of some computational problems
10. 3 Dynamic Planning
10. 3. 1 replacing recursion with a table
10. 3. 2 sequential arrangement of matrix multiplication
10. 3. 3 Best binary search tree
10. 3. 4 all point-to-shortest paths
10. 4 randomization algorithm
10. 4. 1 Random number generator
10. 4. 2 Jumping table
10. 4. 3 primality test
10. 5 Backtracking algorithm
10. 5. 1 Toll Road reconstruction problem
10. 5. 2 games
Summarize
Practice
Reference documents
The 11th chapter of the amortization also analyses
11. 11 Unrelated intellectual problems
11. 22 Items Queue
11. 3 Oblique Heap
11. 4 Fibonacci Heap
11. 4. 1 removing nodes from the left-hand heap
11. 4. Lazy merger of 22 queues
11. 4. 3 Fibonacci Heap Operation
11. 4. 4 Proof of the time realm
11.5 Stretching tree
Summarize
Practice
Reference documents
The 12th chapter advanced data structure and its implementation
12. 1 Top down Stretch tree
12. 2 Red and black trees
12. 2. 1 Bottom-up insertion
12. 2. 2 Top down red black tree
12. 2. 3 Top-down removal
12. 3 Deterministic Jump Table
12. 4 aa-Tree
12. 5 Treap Tree
12. 6 k-d Tree
12. 7 Pairing Heap
Summarize
Practice
Reference documents
: Network Disk Download
Data structure and algorithm analysis-C language description PDF
