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

Vera - Time #32

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Vera - Time #32

wants to merge 1 commit into from

Conversation

veralizeth
Copy link

No description provided.

@veralizeth veralizeth changed the title Liked list exercises Vera - Time Aug 27, 2020
Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work, a few mistakes, notably on space complexity. Take a look at my comments and let me know what questions you have.

Comment on lines +37 to 39
# Time Complexity: O(n)
# Space Complexity: O(n)
def search(value)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The space complexity is O(1) because you're not creating a new list as this method runs.

Comment on lines 56 to 58
# method to return the max value in the linked list
# returns the data value and not the node
def find_max

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +77 to 79
# Time Complexity: O(n)
# Space Complexity: O(n)
def find_min

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 , except the space complexity is O(1)

Comment on lines +97 to 99
# Time Complexity: O(n)
# Space Complexity: O(n)
def length

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 , except space complexity is O(1)

Comment on lines +115 to 117
# Time Complexity: O(n)
# Space Complexity: O(n)
def get_at_index(index)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

What if the length is <= index? You've got to do something to handle that edge case.

return
end

pointer = find_previous(value)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice use of a helper.

Comment on lines +138 to -77
# Time Complexity: O(n)
# Space Complexity: O(n)
def delete(value)
raise NotImplementedError

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 , but of course space complexity.

Comment on lines +202 to 204
# Time Complexity: O(1)
# Space Complexity: O(1)
def get_first

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +210 to 212
# Time Complexity: O(1)
# Space Complexity: O(1)
def add_last(value)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 , however the time complexity is O(n) because you are traveling to the rear of the list.

Comment on lines +233 to 235
# Time Complexity: O(n)
# Space Complexity: O(n)
def get_last

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 , but the space complexity is O(1)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants