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

Fire - Madeline #40

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Fire - Madeline #40

wants to merge 2 commits into from

Conversation

made-line
Copy link

Linked List Comprehension Questions

Question Response
1. What advantages does a LinkedList have over an Array? Linked lists use less memory because they're dynamically allocated. Linked lists don't need contiguous memory, so they can be allocated if there's only fragmented memory available. It's also quick to add/delete nodes to the front/rear of the linked list.
2. When is an Array more advantageous? Arrays are advantageous when we want to jump to an element by the index since the elements are contiguous. Arrays can also be transferred to other devices.
3. What questions do you have about linked lists? What's a real life application where linked lists are used?

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.

Not bad, you hit most of the learning goals, just missing the get_at_index method. Well done.

Comment on lines +10 to 12
# Time complexity - O(1)
# Space complexity - O(1)
def add_first(data)

Choose a reason for hiding this comment

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

👍

Comment on lines +16 to 18
# 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 +22 to -25
# Time complexity - O(n)
# Space complexity - O(1)
def length
return 0

Choose a reason for hiding this comment

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

👍

Comment on lines +37 to 39
# Time complexity - O(n)
# Space complexity - O(1)
def add_last(data)

Choose a reason for hiding this comment

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

👍

Comment on lines +56 to 58
# Time complexity - O(1)
# Space complexity - O(1)
def get_last

Choose a reason for hiding this comment

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

👍 , how could this be O(1) time complexity?

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