/*

Sorting from little to large use List

*/

#include <stdio.h>         /* printf, scanf, NULL */

#include <stdlib.h>     /* malloc, free */

struct node

{

    int key;

    struct node *next;

};

typedef struct node Node;

Node *Head = NULL;

Node *current;

void Insert(int k)

{

    Node *new_node;

    new_node = (Node *)malloc(sizeof(Node));//It is important but i can't understand now

    new_node->key = k;

    /* new node is inserted at the begining of the list*/

    if ( Head == NULL || Head->key > k )

    {

        new_node->next = Head;

        Head = new_node;

    }

    /* new node is inserted somewhere inside the list */

    else

    {

        current = Head;

        /* Check what is the value in the next node , after the current node */

        /* if it is larger, or if the next node not exist */

        /* then we shuold insert the node to next current */

        /* else, update current to point to next node */

        while(1)

        {

            if( current->next == NULL || current->next->key > k )

            {

                new_node->next = current->next;

                current->next = new_node;

                break;

            }

            else

                current = current->next;

        }

    }

}

void Print()

{

        if( Head == NULL )

        printf("The list is empty!\n");

    else

    {

        current = Head;

        while( current != NULL )

        {

            printf("%d ", current->key);

            current = current->next;

        }

        printf("\n");

    }

}

int main()

{

    Insert(15);

    Insert(12);

    Insert(5);

    Print();

    return 0;

}