_Millon_sir_Full_program_Link_List_27-3-17

//D.B.John PC
#include<stdio.h>
#include<stdlib.h>
struct node
{
    int a;
    struct node *p;
};
    int count(struct node *head);
    void Insertion_last_position(struct node *head, int value);
    void Insertion_specific_position(struct node *head, int vv, int pp);
    void Deletion_specific_position(struct node *head, int pp);
    int main()
{
    int n,i,c,pos,v,q;
    struct node *list;

    list=(struct node *)malloc(1*sizeof(struct node));
    list-> a=0;
    list-> p=NULL;

    while(1)
    {
        printf("\n ....Menu....");
         printf("\n press 0 for Quite \n");
        printf("\n press 1 for Insertion \n");
        printf("\n press 2 for Insertion specific position \n");
        printf("\n press 3 Display\n");
        printf("\n press 4 detion spacific profile\n");
        printf("\n press 5 count totall node\n");
        printf("\n press 6 Lenear search \n");

        printf("\n Enter your choise \n");
        scanf("%d",&c);
        switch(c)
        {
            case 0:exit (0);
            break;
            case 1:printf("\n choise=Insertion at last position");
            printf("\n Enter ne value\n");
            scanf("%d",&v);
            Insertion_last_position(list,v);
            break;

            case 2: printf("\n Insertion at specific position \n");
            n=count(list);
            if(n!=0)
            {
                K: printf("\n Enter position between %d to %d \n",1,n+1);
                scanf("%d",& pos);
                if(pos>=1 && pos<=n+1)
                {
                    printf("\n Enter new value \n");

                scanf("%d",&v);
                Insertion_specific_position(list,v,pos);
            }
                    else
                    {
                        printf("\n Wrong position \n");
                        goto K; //D.B.John PC
                    }
            }


            else
                printf("\n The list is empty \n\n");
                break;


            case 4: printf("\n Deletion at specific position \n");
            n=count(list);
            if(n!=0)
            {
                L: printf("\n Enter position between %d to %d \n",1,n);
                scanf("%d",& pos);
                if(pos>=1 && pos<=n)

                Deletion_specific_position(list,pos);

            else
            {
                printf("\n Wrong position \n");
                goto L;

            }
            }


            else
                printf("\n The list is empty \n\n");
                break;



            case 3: printf("\n choise=Display\n");
            if(list->p!=NULL)
            Display(list);
            else
            printf("\n list is Empty \n");
            break;

            case 5: printf("\n choise=Counting total node\n");
            n=count(list);
            printf("\n Total Node=%d\n",n);
            break;

            case 6: printf("\n choise = linear search \n");
            n=count(list);
            if(n!=0)
            {
                printf("\n Enter value for searching \n");
                scanf("%d",&v);
                Linear_search(list,v);
            }
            else

                printf("\n There is no data for searching");
                break;

        }
    }

}
void Insertion_last_position(struct node *head, int value)
{
    struct node *temp;
    while(head->p!=NULL)
    head = head->p;
    temp=(struct node *)malloc(1*sizeof(struct node));
    temp->a=value;
    temp->p=NULL;
    head->p=temp;

}
void Display(struct node *head)
{
    while(head->p!=NULL)
    {
        printf("\n%d \t",head->p->a);
        head=head->p;
    }
}

int count(struct node *head)
{
    int t=0;
    while(head->p!=NULL)
    {
        t=t+1;
        head=head->p;
    }
    return t;
}

void Insertion_specific_position(struct node *head, int vv, int pp)
{
    struct node *temp;
    int i=0;
while(head->p!=NULL)
    {
        if(i==pp-1)
        break;
        head=head->p;
        i=i+1;
    }
    temp=(struct node *)malloc (1* sizeof(struct node));
    temp->a=vv;
    temp->p=head->p;
    head->p=temp;

}

void Deletion_specific_position(struct node *head, int pp)
{
    struct node *temp;
    int i=0;
    while(head->p!=NULL)
    {

        if(i==pp-1)
        break;
        head=head->p;
        i=i+1;
    }
    temp=head->p;
    head->p=temp->p;
    free(temp);

}

void Linear_search(struct node *head, int vv)
{
    int c=0;
    int i=0;
    while(head->p!=NULL)
    {
        if(head->p->a==vv)
        {
            printf("\n Found at position = %d",i+1);
            c=1;
        }
        i=i+1;
        head=head->p;

    }
    if(c==0)
    printf("\n\n Not Found \n\n");
}