Working NewNode function

main.c

@@ -30,8 +30,8 @@ int main(void) {
 
   AddNode(&head,5);
 
-  printf("List Length: %d\n",ListLength(head));
-  
+  PrintLinkedList(head);
+
   return 0;
 }
 
@@ -112,31 +112,51 @@ int ListLength(node *start) {
 
 void AddNode(node **ptr_to_start,int value) {
    
-  node *temp = *ptr_to_start; 
+  node *current = *ptr_to_start; 
   node *new_node = NewNode(value);
-  node *before;
-  node *after;
+
   
-  if (*ptr_to_start == NULL) { // special case if the list is empty 
+  if (*ptr_to_start == NULL)  // special case if the list is empty 
+  { 
     *ptr_to_start = new_node;
     return;
   }
 
 
-  while (temp->next != NULL && temp->next->val < value) {
-
-    if (ptr_to_start == temp) {
-      AddNodeToStartOfList(value);
-      return;
-     }
+  while (current != NULL ) 
+  {
 
-    else {
-    temp = temp->next;
+    if (current->next->val > value) 
+    {
+      if (ptr_to_start == current)  //if it is smaller than the first value, add to start
+      { 
+        AddNodeToStartOfList(ptr_to_start,value);
+        return;
+      }
+
+      else if (current->next == NULL) //if it hits the end of the list/ add to end
+      {
+        AddNodeToEndOfList(ptr_to_start,value);
+        return;
+      }
+      
+      else 
+      {
+        node *temp = current->next;
+        current-> next = new_node;
+        new_node->next=temp;
+        return;
+      }
     }
-    
-  } 
-  NewNode(value);
-  temp->next = 
+
+    else 
+    {
+      current = current->next;
+      }
+  }
+}
+
+