Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fixed some invalid references and more spelling errors. #786

Merged
merged 11 commits into from
May 31, 2021
Prev Previous commit
Next Next commit
Fixed spelling error.
  • Loading branch information
cliftonamccook committed May 31, 2021
commit d1e349952a022db22495a4a34c466a96cf378c0d
2 changes: 1 addition & 1 deletion algorithms/linkedlist/linkedlist.py
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
# in comparison, arrays require O(n) time to do the same thing.
# Linked lists can continue to expand without having to specify
# their size ahead of time (remember our lectures on Array sizing
# form the Array Sequence section of the course!)
# from the Array Sequence section of the course!)

# Cons
# To access an element in a linked list, you need to take O(k) time
Expand Down