-
Notifications
You must be signed in to change notification settings - Fork 37
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
Water - Li #12
base: master
Are you sure you want to change the base?
Water - Li #12
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Well done Li, you hit the learning goals here. Nice work!
# Time Complexity: O(nlogn): add O(nlogn) + remove O(nlogn) | ||
# Space Complexity: O(n) for creating @store to store all the nodes | ||
def heapsort(list) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time Complexity: O(log n): push O(1) + heap_up O(log n) | ||
# Space Complexity: O(log n) : heap_up O(log n) | ||
def add(key, value = key) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time Complexity: O(log n): pop, swap O(1) + heap_down O(log n) | ||
# Space Complexity: O(log n) from heap_down call stacks | ||
def remove() |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time complexity: O(1) | ||
# Space complexity: O(1) | ||
def empty? |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time complexity: O(log n): swap - O(1), and we will do it up to O(log n) times | ||
# Space complexity: O(log n) for call stacks | ||
# min heap, the smallest node goes up to root | ||
def heap_up(index) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# swap parent with the smaller child | ||
# Time complexity: O(log n): find_smaller_childs_index - O(1), swap - O(1), and we will do it up to O(log n) times | ||
# Space complexity: O(log n) for call stacks | ||
def heap_down(index) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 , I like the helper method!
Heaps Practice
Congratulations! You're submitting your assignment!
Comprehension Questions
heap_up
&heap_down
methods useful? Why?