mirror of
https://github.com/krahets/hello-algo.git
synced 2026-09-17 20:17:14 +00:00
Translate all code to English (#1836)
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
This commit is contained in:
@@ -1,6 +1,6 @@
|
||||
# What is an algorithm
|
||||
# What Is an Algorithm
|
||||
|
||||
## Algorithm definition
|
||||
## Algorithm Definition
|
||||
|
||||
An <u>algorithm</u> is a set of instructions or operational steps that solves a specific problem within a finite amount of time. It has the following characteristics.
|
||||
|
||||
@@ -8,7 +8,7 @@ An <u>algorithm</u> is a set of instructions or operational steps that solves a
|
||||
- It is feasible and can be completed within a finite number of steps, time, and memory space.
|
||||
- Each step has a definite meaning, and under the same input and operating conditions, the output is always the same.
|
||||
|
||||
## Data structure definition
|
||||
## Data Structure Definition
|
||||
|
||||
A <u>data structure</u> is a way of organizing and storing data, covering the data content, relationships between data, and methods for data operations. It has the following design objectives.
|
||||
|
||||
@@ -21,7 +21,7 @@ A <u>data structure</u> is a way of organizing and storing data, covering the da
|
||||
- Compared to arrays, linked lists are more convenient for data addition and deletion operations but sacrifice data access speed.
|
||||
- Compared to linked lists, graphs provide richer logical information but require larger memory space.
|
||||
|
||||
## The relationship between data structures and algorithms
|
||||
## The Relationship Between Data Structures and Algorithms
|
||||
|
||||
As shown in the figure below, data structures and algorithms are highly related and tightly coupled, specifically manifested in the following three aspects.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user