Skip to content

Rock - BRITTANY#53

Open
brittanygcle wants to merge 5 commits intoAda-C15:masterfrom
brittanygcle:master
Open

Rock - BRITTANY#53
brittanygcle wants to merge 5 commits intoAda-C15:masterfrom
brittanygcle:master

Conversation

@brittanygcle
Copy link
Copy Markdown

No description provided.

Copy link
Copy Markdown

@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 Brittany, you hit the learning goals here. well done.

Comment on lines +18 to 20
# Time Complexity: O(n)
# Space Complexity: O(1)
def get_first(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 Time & space complexities are O(1)

Comment on lines +28 to 30
# Time Complexity: O(1)
# Space Complexity: O(n)
def add_first(self, value):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 , Space complexity is O(1)

Comment on lines +37 to 39
# Time Complexity: O(n)
# Space Complexity: o(1)
def search(self, value):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍

Comment on lines 48 to 50
# Time Complexity: ?
# Space Complexity: ?
def length(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 space/time complexity?

Comment on lines 61 to 63
# Time Complexity: ?
# Space Complexity: ?
def get_at_index(self, index):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 space/time complexity?

Comment on lines 77 to 79
# Time Complexity: ?
# Space Complexity: ?
def get_last(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 space/time complexity?

Comment on lines +88 to 90
# Time Complexity: O (n)
# Space Complexity: O(1)
def add_last(self, value):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 space/time complexity?


# method to return the max value in the linked list
# returns the data value and not the node
def find_max(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍

Comment on lines +116 to 118
# Time Complexity: O(n)
# Space Complexity: O(1)
def delete(self, value):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 space/time complexity?

Comment on lines 149 to 151
# Time Complexity: ?
# Space Complexity: ?
def reverse(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 space/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