-
Notifications
You must be signed in to change notification settings - Fork 48
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
Earth/Taylor #32
base: master
Are you sure you want to change the base?
Earth/Taylor #32
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 Taylor, you hit the learning goals here. Nice work.
# Time complexity - O(1) - I think these first two would be O(1) because they dont need to traverse the list, while the other 4 do so I assumed O(n) for those | ||
# Space complexity - O(1) | ||
def add_first(data) |
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 get_first |
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(n) | ||
# Space complexity - O(n) - I had some trouble determining space complexity of linked lists methods, I ended up assuming they were probably the same as time complexity. I made this assumption based on the call stack of operations, let me know if I'm off base or misunderstanding | ||
def length |
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.
👍 However the space complexity is O(1) since you're not creating any new lists.
# Time complexity - O(n) | ||
# Space complexity - O(n) | ||
def add_last(data) |
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.
👍 , however the space complexity is O(1)
# Time complexity - O(n) | ||
# Space complexity - O(n) | ||
def get_last |
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.
👍 , however the space complexity is O(1)
# Time complexity - O(n) | ||
# Space complexity - O(n) | ||
def get_at_index(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.
👍 , however the space complexity is O(1)
Linked List Comprehension Questions