xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-16 21:50:59 +00:00
Code Issues Packages Projects Releases Wiki Activity

translation: Capitalize all the headers, list headers and figure captions (#1206)

Browse Source 
* Capitalize all the headers, list headers and figure captions

* Fix the term "LRU"

* Fix the names of source code link in avl_tree.md

* Capitalize only first letter for nav trees in mkdocs.yml

* Update code comments

* Update linked_list.md

* Update linked_list.md
This commit is contained in:
Yudong Jin
2024-04-04 17:09:53 +08:00
committed by GitHub
parent 5e2eef0b4d
commit 07f7eb12ff
34 changed files with 376 additions and 376 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/docs/chapter_preface/about_the_book.md
+6 -6
View File
@@ -1,4 +1,4 @@
# About This Book
# About this book
This open-source project aims to create a free, and beginner-friendly crash course on data structures and algorithms.
@@ -6,7 +6,7 @@ This open-source project aims to create a free, and beginner-friendly crash cour
- Run code with just one click, supporting Java, C++, Python, Go, JS, TS, C#, Swift, Rust, Dart, Zig and other languages.
- Readers are encouraged to engage with each other in the discussion area for each section, questions and comments are usually answered within two days.
## Target Audience
## Target audience
If you are new to algorithms with limited exposure, or you have accumulated some experience in algorithms, but you only have a vague understanding of data structures and algorithms, and you are constantly jumping between "yep" and "hmm", then this book is for you!
@@ -18,15 +18,15 @@ If you are an algorithm expert, we look forward to receiving your valuable sugge
You should know how to write and read simple code in at least one programming language.
## Content Structure
## Content structure
The main content of the book is shown in the following figure.
- **Complexity Analysis**: explores aspects and methods for evaluating data structures and algorithms. Covers methods of deriving time complexity and space complexity, along with common types and examples.
- **Data Structures**: focuses on fundamental data types, classification methods, definitions, pros and cons, common operations, types, applications, and implementation methods of data structures such as array, linked list, stack, queue, hash table, tree, heap, graph, etc.
- **Complexity analysis**: explores aspects and methods for evaluating data structures and algorithms. Covers methods of deriving time complexity and space complexity, along with common types and examples.
- **Data structures**: focuses on fundamental data types, classification methods, definitions, pros and cons, common operations, types, applications, and implementation methods of data structures such as array, linked list, stack, queue, hash table, tree, heap, graph, etc.
- **Algorithms**: defines algorithms, discusses their pros and cons, efficiency, application scenarios, problem-solving steps, and includes sample questions for various algorithms such as search, sorting, divide and conquer, backtracking, dynamic programming, greedy algorithms, and more.
![Main Content of the Book](about_the_book.assets/hello_algo_mindmap.png)
![Main content of the book](about_the_book.assets/hello_algo_mindmap.png)
## Acknowledgements