Hello Algo
简体中文
繁體中文
English
Initializing search
krahets/hello-algo
Hello Algo
krahets/hello-algo
Before starting
Before starting
Chapter 0. Preface
Chapter 0. Preface
0.1 About this book
0.2 How to read
0.3 Summary
Chapter 1. Encounter with algorithms
Chapter 1. Encounter with algorithms
1.1 Algorithms are everywhere
1.2 What is an algorithm
1.3 Summary
Chapter 2. Complexity analysis
Chapter 2. Complexity analysis
2.1 Algorithm efficiency assessment
2.2 Iteration and recursion
2.3 Time complexity
2.4 Space complexity
2.5 Summary
Chapter 3. Data structures
Chapter 3. Data structures
3.1 Classification of data structures
3.2 Basic data types
3.3 Number encoding *
3.4 Character encoding *
3.5 Summary
Chapter 4. Array and linked list
Chapter 4. Array and linked list
4.1 Array
4.2 Linked list
4.3 List
4.4 Memory and cache
4.5 Summary
Chapter 5. Stack and queue
Chapter 5. Stack and queue
5.1 Stack
5.2 Queue
5.3 Double-ended queue
5.4 Summary
Chapter 6. Hash table
Chapter 6. Hash table
6.1 Hash table
6.2 Hash collision
6.3 Hash algorithm
6.4 Summary
Chapter 7. Tree
Chapter 7. Tree
7.1 Binary tree
7.2 Binary tree Traversal
7.3 Array Representation of tree
7.4 Binary Search tree
7.5 AVL tree *
7.6 Summary
Chapter 8. Heap
Chapter 8. Heap
8.1 Heap
8.2 Building a heap
8.3 Top-k problem
8.4 Summary
Chapter 9. Graph
Chapter 9. Graph
9.1 Graph
9.2 Basic graph operations
9.3 Graph traversal
9.4 Summary
404 - Not found
Back to top