Skip to content

🌊 - Beatrice - #21

Open
Beatress wants to merge 2 commits into
Ada-C14:masterfrom
Beatress:master
Open

🌊 - Beatrice#21
Beatress wants to merge 2 commits into
Ada-C14:masterfrom
Beatress:master

Conversation

@Beatress

Copy link
Copy Markdown

No description provided.

@Beatress Beatress changed the title Linked lists 🌊 - Beatrice Mar 23, 2021

@CheezItMan CheezItMan left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

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

Well done Beatrice, you hit the learning goals here. Well done.

Comment thread lib/linked_list.rb
Comment on lines +21 to 23
# Time Complexity: O(1)
# Space Complexity: O(1)
def add_first(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 thread lib/linked_list.rb
Comment on lines +30 to 32
# Time Complexity: O(n) - Must traverse list
# Space Complexity: O(1)
def search(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 thread lib/linked_list.rb
def find_max
raise NotImplementedError
current = @head
max = current&.data

Copy link
Copy Markdown

Choose a reason for hiding this comment

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

Why the &??

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

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

This is to avoid an error stating that there is no such method .data for nil

Comment thread lib/linked_list.rb
Comment on lines +44 to 46
# Time Complexity: O(n) - Must traverse list
# Space Complexity: O(1)
def find_max

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 thread lib/linked_list.rb
Comment on lines +61 to 63
# Time Complexity: O(n) - Must traverse list
# Space Complexity: O(1)
def find_min

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 thread lib/linked_list.rb
Comment on lines +120 to 122
# Time Complexity: O(n) - Must traverse list
# Space Complexity: O(1)
def get_at_index(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.

👍

Comment thread lib/linked_list.rb
Comment on lines +134 to 136
# Time Complexity: O(n) - Must traverse list
# Space Complexity: O(1)
def visit

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 thread lib/linked_list.rb
Comment on lines +147 to 149
# Time Complexity: O(n)
# Space Complexity: O(1)
def delete(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 thread lib/linked_list.rb
Comment on lines +173 to 175
# Time Complexity: O(n)
# Space Complexity: O(1)
def reverse

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 thread lib/linked_list.rb
Comment on lines +192 to 194
# Time Complexity: O(n)
# Space Complexity: O(1)
def get_last

Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍

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