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.

Sign up for GitHub

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
Merged

Fixed some invalid references and more spelling errors. #786

Changes from 1 commit
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
661034b
Corrected spelling anf grammar errors in docstring for heap.
cliftonamccook May 30, 2021
142a0b8
Fixed method signature for remove_min by removing unused parameter i.
cliftonamccook May 31, 2021
7ebda93
Merge branch 'keon:master' into master
cliftonamccook May 31, 2021
7f9196a
Merge remote-tracking branch 'origin/master'
cliftonamccook May 31, 2021
efbad66
Fixed grammar in min_child docstring.
cliftonamccook May 31, 2021
d1e3499
Fixed spelling error.
cliftonamccook May 31, 2021
61db6d7
Fixed spelling errors in matrix_exponentiation.py
cliftonamccook May 31, 2021
eb67a11
Removed trailing semicolons in matrix_inversion.py. TODO: Check for p…
cliftonamccook May 31, 2021
a459e60
Fixed spelling error in base_conversion.py.
cliftonamccook May 31, 2021
587e060
Fixed incorrect reference in min_height.py
cliftonamccook May 31, 2021
bbcf3c3
Fixed incorrect reference in max_height.py
cliftonamccook May 31, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
Corrected spelling anf grammar errors in docstring for heap.
  • Loading branch information
@cliftonamccook
cliftonamccook committed May 30, 2021
commit 661034b726400d3c0e834814698d82235efd018a
6 changes: 3 additions & 3 deletions algorithms/heap/binary_heap.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
"""
Binary Heap. A min heap is a complete binary tree where each node is smaller
its childen. The root, therefore, is the minimum element in the tree. The min
heap use array to represent the data and operation. For example a min heap:
Binary Heap. A min heap is a complete binary tree where each node is smaller than
its children. The root, therefore, is the minimum element in the tree. The min
heap uses an array to represent the data and operation. For example a min heap:

4
/ \
Expand Down