mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-13 12:20:57 +00:00
Revisit the English version (#1835)
* Review the English version using Claude-4.5. * Update mkdocs.yml * Align the section titles. * Bug fixes
This commit is contained in:
Yudong Jin
+24
-25
@@ -9,15 +9,14 @@ docs_dir: ../build/en/docs
|
||||
site_dir: ../site/en
|
||||
# Repository
|
||||
edit_uri: tree/main/en/docs
|
||||
version: 1.0.0
|
||||
version: 1.2.0
|
||||
|
||||
# Configuration
|
||||
theme:
|
||||
custom_dir: ../build/overrides
|
||||
language: en
|
||||
font:
|
||||
text: Roboto
|
||||
code: Roboto Mono
|
||||
text: Lato
|
||||
palette:
|
||||
- scheme: default
|
||||
primary: white
|
||||
@@ -44,9 +43,9 @@ nav:
|
||||
# [icon: material/book-open-outline]
|
||||
- chapter_preface/index.md
|
||||
- 0.1 About this book: chapter_preface/about_the_book.md
|
||||
- 0.2 How to read: chapter_preface/suggestions.md
|
||||
- 0.2 How to use this book: chapter_preface/suggestions.md
|
||||
- 0.3 Summary: chapter_preface/summary.md
|
||||
- Chapter 1. Encounter with algorithms:
|
||||
- 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
|
||||
@@ -55,7 +54,7 @@ nav:
|
||||
- Chapter 2. Complexity analysis:
|
||||
# [icon: material/timer-sand]
|
||||
- chapter_computational_complexity/index.md
|
||||
- 2.1 Algorithm efficiency assessment: chapter_computational_complexity/performance_evaluation.md
|
||||
- 2.1 Algorithm efficiency evaluation: 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
|
||||
@@ -83,7 +82,7 @@ nav:
|
||||
- 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:
|
||||
- Chapter 6. Hashing:
|
||||
# [icon: material/table-search]
|
||||
- chapter_hashing/index.md
|
||||
- 6.1 Hash table: chapter_hashing/hash_map.md
|
||||
@@ -95,8 +94,8 @@ nav:
|
||||
- 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.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:
|
||||
@@ -110,7 +109,7 @@ nav:
|
||||
# [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.2 Basic operations on graphs: chapter_graph/graph_operations.md
|
||||
- 9.3 Graph traversal: chapter_graph/graph_traversal.md
|
||||
- 9.4 Summary: chapter_graph/summary.md
|
||||
- Chapter 10. Searching:
|
||||
@@ -118,8 +117,8 @@ nav:
|
||||
- chapter_searching/index.md
|
||||
- 10.1 Binary search: chapter_searching/binary_search.md
|
||||
- 10.2 Binary search insertion: chapter_searching/binary_search_insertion.md
|
||||
- 10.3 Binary search boundaries: chapter_searching/binary_search_edge.md
|
||||
- 10.4 Hashing optimization strategies: chapter_searching/replace_linear_by_hashing.md
|
||||
- 10.3 Binary search edge cases: chapter_searching/binary_search_edge.md
|
||||
- 10.4 Hash optimization strategy: chapter_searching/replace_linear_by_hashing.md
|
||||
- 10.5 Search algorithms revisited: chapter_searching/searching_algorithm_revisited.md
|
||||
- 10.6 Summary: chapter_searching/summary.md
|
||||
- Chapter 11. Sorting:
|
||||
@@ -141,31 +140,31 @@ nav:
|
||||
- chapter_divide_and_conquer/index.md
|
||||
- 12.1 Divide and conquer algorithms: 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 binary tree problem: chapter_divide_and_conquer/build_binary_tree_problem.md
|
||||
- 12.4 Tower of Hanoi Problem: chapter_divide_and_conquer/hanota_problem.md
|
||||
- 12.3 Building a binary tree problem: chapter_divide_and_conquer/build_binary_tree_problem.md
|
||||
- 12.4 Hanoi tower 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 algorithms: chapter_backtracking/backtracking_algorithm.md
|
||||
- 13.2 Permutation 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.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 Characteristics of DP problems: chapter_dynamic_programming/dp_problem_features.md
|
||||
- 14.3 DP problem-solving approach¶: chapter_dynamic_programming/dp_solution_pipeline.md
|
||||
- 14.4 0-1 Knapsack problem: chapter_dynamic_programming/knapsack_problem.md
|
||||
- 14.2 Characteristics of dynamic programming problems: chapter_dynamic_programming/dp_problem_features.md
|
||||
- 14.3 Dynamic programming problem-solving 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 algorithms: chapter_greedy/greedy_algorithm.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
|
||||
@@ -173,8 +172,8 @@ nav:
|
||||
- Chapter 16. Appendix:
|
||||
# [icon: material/help-circle-outline]
|
||||
- chapter_appendix/index.md
|
||||
- 16.1 Installation: chapter_appendix/installation.md
|
||||
- 16.2 Contributing: chapter_appendix/contribution.md
|
||||
- 16.3 Terminology: chapter_appendix/terminology.md
|
||||
- 16.1 Programming environment installation: chapter_appendix/installation.md
|
||||
- 16.2 Contributing Together: chapter_appendix/contribution.md
|
||||
- 16.3 Terminology Table: chapter_appendix/terminology.md
|
||||
- References:
|
||||
- chapter_reference/index.md
|
||||
|
||||
Reference in New Issue
Block a user