sorted1_Linked_list_DS.txt

#include<stdio.h>
#include<malloc.h>

typedef struct list
{
    int data;
    struct list *next;
} list;


void insert_sort(list **head,int value)
{
    list *node=(list *)malloc(sizeof(list));

    node->data=value;
    node->next=NULL;

    if(*head==NULL || (*head)->data>=value)
    {
        node->next=*head;
        *head=node;
    }

    else
    {
        list *p=*head;

        while(p->next !=NULL)
        {
            if(p->data<=value && (p->next)->data >=value )
            {
                node->next=p->next;
                p->next=node;

                return;
            }

            else
            {
                p=p->next;
            }

        }
        p->next=node;

    }
}

void insert_end(list **head,int value)
{
    list *node=(list *)malloc(sizeof(list));

    node->data=value;
    node->next=NULL;

    if(*head==NULL)
    {
        *head=node;
    }
    else
    {
        list *p=*head;
        while(p->next !=NULL)
        {
            p=p->next;
        }
        p->next=node;
    }

}
void print(list *head)
{
    if(head==NULL)
    {
        printf("List is empty");
    }
    else
    {
        while(head != NULL)
        {
            printf("%d -> ",head->data);
            head=head->next;
        }
        printf("NULL\n");

    }

}

int main()
{
    list *head1=NULL;
    list *head2=NULL;

    int i,n,value;

    printf("Enter total size : ");
    scanf("%d",&n);

    for(i=0; i<n; i++)
    {
        scanf("%d",&value);
        insert_end(&head1,value);
    }

    printf("List is : ");
    print(head1);

    list *p=head1;

    while(p !=NULL)
    {
        insert_sort(&head2,p->data);
        p=p->next;
    }

    printf("Sorted Linked List is : ");
    print(head2);

    return 0;
}