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

Earth - Anya #33

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

Earth - Anya #33

wants to merge 3 commits into from

Conversation

anyatokar
Copy link

Linked List Comprehension Questions

Question Response
1. What advantages does a LinkedList have over an Array? Deletion and insertion are easier because you just have to change what the previous element points to. In array, have to shift the rest of the elements. Also, when you don't have enough continuous space in memory to allocate for an array, linked list doesn't mind jumping around and therefore is more useful in that way.
2. When is an Array more advantageous? Reading data is better from the array, unless you just need the first element in which case it's the same. Array gives you indexed access to elements. Linked list does not have an index.
3. What questions do you have about linked lists? I think I understand the concept but this assignment was hard for me. I would like more practice building linked lists.

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.

Well done Anya, you hit the learning goals here. Nice work.

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 +17 to 19
# 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 +24 to 26
# Time complexity - O(n)
# Space complexity - O(1)
def length

Choose a reason for hiding this comment

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

👍

Comment on lines +36 to 38
# 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 +50 to 52
# Time complexity - O(n)
# 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.

👍

Comment on lines +61 to 63
# Time complexity - O(n)
# Space complexity - O(1)
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.

👍 Nice recursive helper

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