-
Notifications
You must be signed in to change notification settings - Fork 40
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
Branches - Julia Bouvier #15
base: master
Are you sure you want to change the base?
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, you hit all the learning goals here. Nice work. Do take a look at my notes regarding time/space complexity. It's important to have a good grasp on this.
# Time Complexity: n(log(n)) | ||
# Space Complexity: O(1) | ||
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.
How do you have a space complexity of O(1)? You're building a new heap of n elements...
Otherwise this works.
# Time Complexity: log(n) | ||
# Space Complexity: 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: log(n) | ||
# Space Complexity: log(n) | ||
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.
👍
def empty? | ||
raise NotImplementedError, "Method not implemented yet..." | ||
return true if @store.length == 0 |
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.
return true if @store.length == 0 | |
return @store.length == 0 |
# Time complexity: O(n) | ||
# 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.
How is this O(n) time complexity? Otherwise it works.
# Time complexity: log(n) | ||
# Space complexity: log(n) | ||
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.
👍
lc_index = index * 2 + 1 | ||
rc_index = index * 2 + 2 | ||
return if @store[lc_index].nil? && @store[rc_index].nil? | ||
return if index == @store.length - 1 |
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 think this line is unnecessary since if they are at the end of the array, they have no children.
return if index == 0 || @store[index].key >= @store[parent_index].key | ||
|
||
swap(index, parent_index) | ||
return heap_up(parent_index) | ||
end | ||
|
||
# This helper method takes an index and | ||
# moves it up the heap if it's smaller | ||
# than it's parent node. | ||
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.
👍
Heaps Practice
Congratulations! You're submitting your assignment!
Comprehension Questions
heap_up
&heap_down
methods useful? Why?