forked from krahets/hello-algo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmkdocs-en.yml
164 lines (160 loc) · 7.96 KB
/
mkdocs-en.yml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
# Config inheritance
INHERIT: mkdocs.yml
# Project information
site_name: Hello Algo
site_url: https://www.hello-algo.com/en/
site_description: "Data Structures and Algorithms Crash Course with Animated Illustrations and Off-the-Shelf Code"
docs_dir: build/docs-en
site_dir: site/en
# Repository
edit_uri: tree/main/docs-en
version: 1.0.0b6
# Configuration
theme:
language: en
font:
text: Roboto
code: Fira Code
extra:
status:
new: Recently Added
# Page tree
nav:
- Chapter 0. Preface:
# [icon: material/book-open-outline]
- chapter_preface/index.md
- 0.1 The Book: chapter_preface/about_the_book.md
- 0.2 How to Read: chapter_preface/suggestions.md
- 0.3 Summary: chapter_preface/summary.md
- Chapter 1. Introduction to Algorithms:
# [icon: material/calculator-variant-outline]
- chapter_introduction/index.md
- 1.1 Algorithms Are Everywhere: chapter_introduction/algorithms_are_everywhere.md
- 1.2 What is Algorithms: chapter_introduction/what_is_dsa.md
- 1.3 Summary: chapter_introduction/summary.md
- Chapter 2. Computational Complexity:
# [icon: material/timer-sand]
- chapter_computational_complexity/index.md
- 2.1 Evaluating Algorithm Efficiency: chapter_computational_complexity/performance_evaluation.md
- 2.2 Iteration and Recursion: chapter_computational_complexity/iteration_and_recursion.md
- 2.3 Time Complexity: chapter_computational_complexity/time_complexity.md
- 2.4 Space Complexity: chapter_computational_complexity/space_complexity.md
- 2.5 Summary: chapter_computational_complexity/summary.md
# - Chapter 3. Data Structure:
# # [icon: material/shape-outline]
# - chapter_data_structure/index.md
# - 3.1 Classification of Data Structure: chapter_data_structure/classification_of_data_structure.md
# - 3.2 Basic Data Types: chapter_data_structure/basic_data_types.md
# - 3.3 Number Encoding *: chapter_data_structure/number_encoding.md
# - 3.4 Character Encoding *: chapter_data_structure/character_encoding.md
# - 3.5 Summary: chapter_data_structure/summary.md
# - Chapter 4. Array and Linked List:
# # [icon: material/view-list-outline]
# - chapter_array_and_linkedlist/index.md
# - 4.1 Array: chapter_array_and_linkedlist/array.md
# - 4.2 Linked List: chapter_array_and_linkedlist/linked_list.md
# - 4.3 List: chapter_array_and_linkedlist/list.md
# - 4.4 Summary: chapter_array_and_linkedlist/summary.md
# - Chapter 5. Stack and Queue:
# # [icon: material/stack-overflow]
# - chapter_stack_and_queue/index.md
# - 5.1 Stack: chapter_stack_and_queue/stack.md
# - 5.2 Queue: chapter_stack_and_queue/queue.md
# - 5.3 Double-ended Queue: chapter_stack_and_queue/deque.md
# - 5.4 Summary: chapter_stack_and_queue/summary.md
# - Chapter 6. Hash Table:
# # [icon: material/table-search]
# - chapter_hashing/index.md
# - 6.1 Hash Table: chapter_hashing/hash_map.md
# - 6.2 Hash Collision: chapter_hashing/hash_collision.md
# - 6.3 Hash Algorithm: chapter_hashing/hash_algorithm.md
# - 6.4 Summary: chapter_hashing/summary.md
# - Chapter 7. Tree:
# # [icon: material/graph-outline]
# - chapter_tree/index.md
# - 7.1 Binary Tree: chapter_tree/binary_tree.md
# - 7.2 Binary Tree Traversal: chapter_tree/binary_tree_traversal.md
# - 7.3 Array Representation of Tree: chapter_tree/array_representation_of_tree.md
# - 7.4 Binary Search Tree: chapter_tree/binary_search_tree.md
# - 7.5 AVL Tree *: chapter_tree/avl_tree.md
# - 7.6 Summary: chapter_tree/summary.md
# - Chapter 8. Heap:
# # [icon: material/family-tree]
# - chapter_heap/index.md
# - 8.1 Heap: chapter_heap/heap.md
# - 8.2 Building a Heap: chapter_heap/build_heap.md
# - 8.3 Top-K Problem: chapter_heap/top_k.md
# - 8.4 Summary: chapter_heap/summary.md
# - Chapter 9. Graph:
# # [icon: material/graphql]
# - chapter_graph/index.md
# - 9.1 Graph: chapter_graph/graph.md
# - 9.2 Basic Graph Operations: chapter_graph/graph_operations.md
# - 9.3 Graph Traversal: chapter_graph/graph_traversal.md
# - 9.4 Summary: chapter_graph/summary.md
# - Chapter 10. Searching:
# # [icon: material/text-search]
# - chapter_searching/index.md
# - 10.1 Binary Search: chapter_searching/binary_search.md
# - 10.2 Binary Search Insertion Point: chapter_searching/binary_search_insertion.md
# - 10.3 Binary Search Boundaries: chapter_searching/binary_search_edge.md
# - 10.4 Hashing Optimization Strategy: chapter_searching/replace_linear_by_hashing.md
# - 10.5 Revisiting Search Algorithms: chapter_searching/searching_algorithm_revisited.md
# - 10.6 Summary: chapter_searching/summary.md
# - Chapter 11. Sorting:
# # [icon: material/sort-ascending]
# - chapter_sorting/index.md
# - 11.1 Sorting Algorithms: chapter_sorting/sorting_algorithm.md
# - 11.2 Selection Sort: chapter_sorting/selection_sort.md
# - 11.3 Bubble Sort: chapter_sorting/bubble_sort.md
# - 11.4 Insertion Sort: chapter_sorting/insertion_sort.md
# - 11.5 Quick Sort: chapter_sorting/quick_sort.md
# - 11.6 Merge Sort: chapter_sorting/merge_sort.md
# - 11.7 Heap Sort: chapter_sorting/heap_sort.md
# - 11.8 Bucket Sort: chapter_sorting/bucket_sort.md
# - 11.9 Counting Sort: chapter_sorting/counting_sort.md
# - 11.10 Radix Sort: chapter_sorting/radix_sort.md
# - 11.11 Summary: chapter_sorting/summary.md
# - Chapter 12. Divide and Conquer:
# # [icon: material/set-split]
# - chapter_divide_and_conquer/index.md
# - 12.1 Divide and Conquer Algorithm: chapter_divide_and_conquer/divide_and_conquer.md
# - 12.2 Divide and Conquer Search Strategy: chapter_divide_and_conquer/binary_search_recur.md
# - 12.3 Building Tree Problems: chapter_divide_and_conquer/build_binary_tree_problem.md
# - 12.4 Tower of Hanoi Problem: chapter_divide_and_conquer/hanota_problem.md
# - 12.5 Summary: chapter_divide_and_conquer/summary.md
# - Chapter 13. Backtracking:
# # [icon: material/map-marker-path]
# - chapter_backtracking/index.md
# - 13.1 Backtracking Algorithm: chapter_backtracking/backtracking_algorithm.md
# - 13.2 Permutations Problem: chapter_backtracking/permutations_problem.md
# - 13.3 Subset Sum Problem: chapter_backtracking/subset_sum_problem.md
# - 13.4 N-Queens Problem: chapter_backtracking/n_queens_problem.md
# - 13.5 Summary: chapter_backtracking/summary.md
# - Chapter 14. Dynamic Programming:
# # [icon: material/table-pivot]
# - chapter_dynamic_programming/index.md
# - 14.1 Introduction to Dynamic Programming: chapter_dynamic_programming/intro_to_dynamic_programming.md
# - 14.2 Features of DP Problems: chapter_dynamic_programming/dp_problem_features.md
# - 14.3 DP Solution Approach: chapter_dynamic_programming/dp_solution_pipeline.md
# - 14.4 0-1 Knapsack Problem: chapter_dynamic_programming/knapsack_problem.md
# - 14.5 Unbounded Knapsack Problem: chapter_dynamic_programming/unbounded_knapsack_problem.md
# - 14.6 Edit Distance Problem: chapter_dynamic_programming/edit_distance_problem.md
# - 14.7 Summary: chapter_dynamic_programming/summary.md
# - Chapter 15. Greedy:
# # [icon: material/head-heart-outline]
# - chapter_greedy/index.md
# - 15.1 Greedy Algorithm: chapter_greedy/greedy_algorithm.md
# - 15.2 Fractional Knapsack Problem: chapter_greedy/fractional_knapsack_problem.md
# - 15.3 Maximum Capacity Problem: chapter_greedy/max_capacity_problem.md
# - 15.4 Maximum Product Cutting Problem: chapter_greedy/max_product_cutting_problem.md
# - 15.5 Summary: chapter_greedy/summary.md
# - Chapter 16. Appendix:
# # [icon: material/help-circle-outline]
# - chapter_appendix/index.md
# - 16.1 Installation of Programming Environment: chapter_appendix/installation.md
# - 16.2 Contributing to the Creation: chapter_appendix/contribution.md
# # [status: new]
# - 16.3 Terminology: chapter_appendix/terminology.md
# - References:
# - chapter_reference/index.md