Repository navigation
Clarify and reorganize algorithm documentation - #29
Merged
Merged
Conversation
Refresh the repository documentation so readers can move from fundamentals to algorithmic techniques through a consistent, navigable set of notes. Normalize heading levels, list styles, emphasis, equations, tables, and code examples across the algorithm guides. Rewrite explanations of recursion, backtracking, graph traversal, and sorting to distinguish related concepts, state assumptions, and keep the narrative focused on the algorithmic invariant. Correct recurrence notation, edge-case handling, stability claims, complexity bounds, auxiliary-space descriptions, and implementation guidance where the previous text was ambiguous or misleading. Expand the sorting comparison material to cover the revised merge, quick, heap, radix, and counting sort guidance with clearer constraints and terminology. Update the root README with a progressive reading order that links directly to the notes, and remove stale presentation artifacts while preserving the existing implementation references.
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Refresh the repository documentation so readers can move from fundamentals to algorithmic techniques through a consistent, navigable set of notes. Normalize heading levels, list styles, emphasis, equations, tables, and code examples across the algorithm guides. Rewrite explanations of recursion, backtracking, graph traversal, and sorting to distinguish related concepts, state assumptions, and keep the narrative focused on the algorithmic invariant. Correct recurrence notation, edge-case handling, stability claims, complexity bounds, auxiliary-space descriptions, and implementation guidance where the previous text was ambiguous or misleading. Expand the sorting comparison material to cover the revised merge, quick, heap, radix, and counting sort guidance with clearer constraints and terminology. Update the root README with a progressive reading order that links directly to the notes, and remove stale presentation artifacts while preserving the existing implementation references.