Addie's Linked List

README.md

@@ -1,10 +1,15 @@
-# Linked-List
+# Linked List in Go
+Assignment completed during my time at Ada Developers Academy. It implements methods for a linked list, along with a test suite, written in Go.
+
+Original instructions below:
+
+## Linked-List
 Using object oriented design constructs, define a Node class and LinkedList class for a singly linked list. Each node has integer data value and a link to the next node. The linked list class has a head node and the following methods defined.
 
 ## Exercise
 Design and implement the classes and the methods.
 Methods to implement in the singly linked list:
-  - *insert*: method to add a new node with the specific input data value in the linked list. 
+  - *insert*: method to add a new node with the specific input data value in the linked list.
               Insert the new node at the beginning of the linked list
   - *search*: method to find if the linked list contains a node with specified input value. Returns true if found, false otherwise.
   - *find_max*: method to return the max value in the linked list. Returns the data value and not the node.
@@ -23,4 +28,3 @@ Methods to implement in the singly linked list:
   - *find_nth_from_end*: find the nth node from the end and return its value. Assume indexing starts at 0 while counting to n.
   - *has_cycle*: Checks if the linked list has a cycle. A cycle exists if any node in the linked list links to a node already visited.  
                  Returns true if a cycle is found, false otherwise.
-