Corrected grammatical and typographical errors in cheat sheet #34
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
- Updated Big-O definition in Asymptotic Notation section - Corrected "ideal input" typo in Best Case definition - Improved DFS traversal description in Search Algorithms section - Clarified Insertion Sort performance description - Fixed Merge Sort worst-case space complexity This commit addresses minor issues to improve readability and accuracy.
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.
Asymptotic Notation
Correction: "Big-O refers to the upper bound of time or space complexity of an algorithm, meaning it worst case runtime scenario."
Updated: "Big-O refers to the upper bound of time or space complexity of an algorithm, typically representing the worst-case runtime scenario."
Typo: "Best case means a ideal input."
Updated: "Best case means an ideal input."
Search Algorithms - Depth First Search
Correction: "It traverses left down a tree until it cannot go further."
Updated: "It traverses down the left side of a tree until it cannot go further."
Sorting Algorithms - Insertion Sort
Correction: "Although it has an O(n^2) time complexity, in practice it "is slightly less" since its comparison scheme only requires checking place if it is smaller than its neighbor."
Updated: "Although it has an O(n^2) time complexity, in practice it "can perform better" since its comparison scheme only requires checking place if it is smaller than its neighbor."
Sorting Algorithms - Merge Sort
Correction: "Worst Case: O(1)"
Updated: "Worst Case: O(n)" (because merge sort requires additional space proportional to the input size.)