diff --git a/lib/linked_list.rb b/lib/linked_list.rb
index 501c60fb..8ca6041e 100644
--- a/lib/linked_list.rb
+++ b/lib/linked_list.rb
@@ -21,87 +21,171 @@ def initialize
     # Time Complexity:  
     # Space Complexity
     def add_first(value)
-      raise NotImplementedError
+      @head = Node.new(value, @head)
     end
 
     # method to find if the linked list contains a node with specified value
     # returns true if found, false otherwise
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity: O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def search(value)
-      raise NotImplementedError
+      return false if @head = nil
+
+      current = @head
+      until current == nil
+        if current.data == value
+          return true
+        end
+        current = current.next
+      end
+      return false
     end
 
     # method to return the max value in the linked list
     # returns the data value and not the node
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity: O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def find_max
-      raise NotImplementedError
+      return nil if @head == nil
+      max = @head.data
+      current = @head
+
+      while current != nil
+        if current.data > max
+          max = current.data
+          
+        end
+        current = current.next
+      end
+
+      return max
     end
 
     # method to return the min value in the linked list
     # returns the data value and not the node
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity:  O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def find_min
-      raise NotImplementedError
+      return nil if @head == nil
+      min = @head.data
+      current = @head
+
+      while current != nil
+        if current.data < min
+          min = current.data
+        end
+        current = current.next
+      end
+
+      return min
     end
 
 
     # method that returns the length of the singly linked list
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity: O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def length
-      raise NotImplementedError
+      count = 0 
+      current = @head
+      while current != nil
+        count += 1
+        current = current.next
+      end
+      return count
     end
 
     # method that returns the value at a given index in the linked list
     # index count starts at 0
     # returns nil if there are fewer nodes in the linked list than the index value
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity:  O(n), where n is the size of the index
+    # Space Complexity: O(1)
     def get_at_index(index)
-      raise NotImplementedError
+      return nil if @head == nil
+      return nil if (self.length - 1) < index
+
+      current = @head
+
+      index.times do 
+        current = current.next
+      end
+
+      return current.data
     end
 
     # method to print all the values in the linked list
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity: O(n), where n is the length of the list
+    # Space Complexity: ?? I'm not sure if puts counts as using memory.  If it does, then O(n), where n is the length of the list. Otherwise O(1)
     def visit
-      raise NotImplementedError
+      current = @head
+
+      while current != nil
+        puts current.data
+      end
     end
 
     # method to delete the first node found with specified value
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity: O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def delete(value)
-      raise NotImplementedError
+      return nil if @head == nil
+
+      if @head.data == value
+        @head = @head.next
+        return
+      end
+
+      current = @head
+
+      while current.next != nil
+        if current.next.data == value
+          current.next = current.next.next
+          return
+        end
+        current = current.next
+      end
     end
 
     # method to reverse the singly linked list
     # note: the nodes should be moved and not just the values in the nodes
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity: O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def reverse
-      raise NotImplementedError
+      current = @head
+      previous = nil
+      
+      while current != nil
+        temp = current.next
+        current.next = previous
+        previous = current
+        current = temp
+      end
+      
+      @head = previous
     end
 
 
     ## Advanced Exercises
     # returns the value at the middle element in the singly linked list
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity:  O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def find_middle_value
-      raise NotImplementedError
+      return self.get_at_index(self.length / 2)
     end
 
     # find the nth node from the end and return its value
     # assume indexing starts at 0 while counting to n
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity:  O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def find_nth_from_end(n)
-      raise NotImplementedError
+      largest_index = self.length - 1
+      return nil if n > largest_index
+      count = 0
+      current = @head
+      until (largest_index - count) == n 
+        count +=1
+        current = current.next
+      end
+      return current.data
     end
 
     # checks if the linked list has a cycle. A cycle exists if any node in the
@@ -117,33 +201,57 @@ def has_cycle
     # Additional Exercises 
     # returns the value in the first node
     # returns nil if the list is empty
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity: O(1)
+    # Space Complexity O(1)
     def get_first
-      raise NotImplementedError
+      return nil if @head == nil
+      return @head.data
     end
 
     # method that inserts a given value as a new last node in the linked list
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity:  O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def add_last(value)
-      raise NotImplementedError
+      if @head == nil
+        @head = Node.new(value, nil)
+      else
+        current = @head
+        while current.next != nil
+          current = current.next
+        end
+
+        current.next = Node.new(value, nil)
+      end
     end
 
     # method that returns the value of the last node in the linked list
     # returns nil if the linked list is empty
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity:  O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def get_last
-      raise NotImplementedError
+      return nil if @head == nil
+      current = @head
+        while current.next != nil
+          current = current.next
+        end
+      
+      return current.data
     end
 
     # method to insert a new node with specific data value, assuming the linked
     # list is sorted in ascending order
-    # Time Complexity:  
-    # Space Complexity
+    # Time Complexity:  O(n), where n is the length of the list
+    # Space Complexity: O(1)
     def insert_ascending(value)
-      raise NotImplementedError
+      add_first(value) if @head == nil
+
+      current = @head
+      while current.next != nil
+        if current.next.data > value
+          new_node = Node.new(value, current.next)
+          current.next = new_node
+        end
+      end
     end
 
     # Helper method for tests