/* Monolithic example of implementing an ordered list using a linked list */

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

typedef struct listNode
{
   int data;
   struct listNode * next;
} ListNode;

typedef ListNode * ListNodePtr; 


int main()
{
   ListNodePtr head, new, current, previous, next;
   unsigned listSize;
   int i, anInt;

   listSize = 0;
   head = NULL;

   while (scanf("%d", &anInt) == 1)
   {
      if ( (new=malloc(sizeof(ListNode))) == NULL)
      {
           fprintf(stderr,"\nMemory Allocation for ListInsert failed! Aborting data entry!");
	   break;	
      }

      current = head;
      previous = NULL;

      /* Search to find where in insert new list node */
      while (current != NULL && current->data < anInt)
      {
	previous = current;
	current = current->next;
      }

      new->data = anInt;
      new->next = current;
      listSize++;

      if (previous == NULL)
      {
	head = new;
      }
      else
      {
	previous->next = new;
      }
   }

   /* Display integers in linked list */
   current = head;
   while (current != NULL)
   {
      printf("%d\n", current->data);
      current = current->next;
   }

   /* Deallocate memory used by list nodes */
   current = head;
   while (current != NULL)
   {
      next = current->next;
      free(current);
      current = next;
   }

   return EXIT_SUCCESS;
}