Implemented methods #20

brikemp · 2019-12-06T21:56:53Z

Linked List Comprehension Questions

Question	Response
1. What advantages does a LinkedList have over an Array?	With a LinkedList elements can be inserted or removed without reallocation of the entire structure because the items don't need to be stored contiguously in memory.
2. When is an Array more advantageous?	Accessing a specific index of an array is O(1), while with a linked list it is O(n)

CheezItMan

You definitely have a feel for linked lists, but you have a few bugs here. Take a look at my comments and let me know if you have questions.

CheezItMan · 2019-12-18T05:33:53Z

lib/linked_list.rb

-  # Space complexity - ?
+
+  # Time complexity - O(1)
+  # Space complexity - O(1)
  def add_first(data)


CheezItMan · 2019-12-18T05:34:00Z

lib/linked_list.rb

+  end 
+
+  # Time complexity - O(1)
+  # Space complexity - O(1)
  def get_first


CheezItMan · 2019-12-18T05:34:14Z

lib/linked_list.rb

-  # Space complexity - ?
+
+  # Time complexity - O(n)
+  # Space complexity - O(1)
  def length


CheezItMan · 2019-12-18T05:34:26Z

lib/linked_list.rb

-  # Space complexity - ?
+
+  # Time complexity - O(n)
+  # Space complexity - O(1)
  def add_last(data)


CheezItMan · 2019-12-18T05:34:59Z

lib/linked_list.rb

  def get_last
-
+    current = head


What if head is nil?

Suggested change

current = head

return nil if head.nil?

current = head

CheezItMan · 2019-12-18T05:35:20Z

lib/linked_list.rb

-  # Space complexity - ?
+
+  # Time complexity - O(n)
+  # Space complexity - O(1)
  def get_at_index(index)


What if the index is past the end of the list?

Implemented methods

22a56d7

CheezItMan reviewed Dec 18, 2019

View reviewed changes