Updated terminology.md #1043
Merged
Updated terminology.md #1043
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
krahets
reviewed
Jan 14, 2024
| @@ -1,14 +1,14 @@ | |||
| # Queue | |||
|
|
|||
| "Queue" is a linear data structure that follows the First-In-First-Out (FIFO) rule. As the name suggests, a queue simulates the phenomenon of lining up, where newcomers join the back of the queue, and people at the front of the queue leave one by one. | |||
There was a problem hiding this comment.
Please remove all the changes in queue.md in this PR
krahets
reviewed
Jan 14, 2024
docs/chapter_appendix/terminology.md
Outdated
| | 缓存命中率 | cache hit rate | 二分查找 | binary search | | ||
| | 栈 | stack | 搜索算法 | searching algorithm | | ||
| | 栈顶 | top of the stack | 排序算法 | sorting algorithm | | ||
| | 栈尾 | bottom of the stack | 选择排序 | selection sort | |
longsizhuo
force-pushed
the
new-feature-branch
branch
from
ea85491 to
de315c2
Compare
krahets
reviewed
Jan 15, 2024
docs/chapter_appendix/terminology.md
Outdated
| | 缓存命中率 | cache hit rate | 二分查找 | binary search | | ||
| | 栈 | stack | 搜索算法 | searching algorithm | | ||
| | 栈顶 | top of the stack | 排序算法 | sorting algorithm | | ||
| | 栈尾 | bottom of the stack | 选择排序 | selection sort | |
krahets
reviewed
Jan 28, 2024
docs/chapter_appendix/terminology.md
Outdated
| | 递归 | recursion | 堆 | heap | | ||
| | 尾递归 | tail recursion | 大顶堆 | max heap | | ||
| | 递归树 | recursion tree | 小顶堆 | min heap | | ||
| | 大 O 记号 | big-O notation | 优先队列 | priority queue | |
There was a problem hiding this comment.
Please keep other glossaries invariant when adding the new glossaries.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Key Additions:
Head and Tail of Data Structures:
New entries have been added to explicitly define the terms "head" and "tail" for data structures like linked lists, queues, and stacks. This enhancement is crucial for clarity, as these terms are fundamental in understanding and implementing these structures.
For instance, "头节点" (head node) and "尾节点" (tail node) for linked lists, "队首" (front of the queue) and "队尾" (rear of the queue) for queues, and "栈顶" (top of the stack) and "栈尾" (bottom of the stack) for stacks are now clearly mentioned.