#include<stdio.h>
#include<conio.h>
#include<alloc.h>

struct node { int x; struct node *next; } ;

struct node *head, *curr, *tail, *delte, *insert, *temp;

void input() { printf("Press '0' to Exit Input\n\n"); curr=(struct node*)malloc(sizeof(node)); printf("Enter an Integer: "); scanf("%d", &curr->x); while(curr->x!=0) { if(head==NULL) { head=curr; head->next=NULL; tail=curr; } else { tail->next=curr; tail=curr; curr->next=NULL; } curr=(struct node*)malloc(sizeof(node)); printf("Enter an Integer: "); scanf("%d", &curr->x); } }

void sort() { int no_ex; int x;

curr=head; do { no_ex=0; curr=head; while(curr->next!=NULL) { if(curr->x>curr->next->x) { x=curr->x; curr->x=curr->next->x; curr->next->x=x; no_ex=1; }

curr=curr->next; } } while(no_ex);

}

void insrt() { int test=0; printf("\nWhat to Insert?: "); insert=(struct node*)malloc(sizeof(node)); scanf("%d", &insert->x);

curr=head; if(head->x>insert->x) { insert->next=head; head=insert; } else { while(curr->next!=NULL) { if(curr->next->x>insert->x&&test!=1) { insert->next=curr->next; curr->next=insert; test=1; } curr=curr->next; }

if(!test) { insert->next=curr->next; curr->next=insert; } } curr=head; while(curr!=NULL) { printf("%3d", curr->x); curr=curr->next; }

} void delet() { int x, tst; printf("\nWhat to delete?: "); scanf("%d", &x); curr=head; if(head->x==x) { head=head->next; } else { while(curr!=NULL) { if(curr->x==x) { temp=curr->next; delte=curr; curr=head; while(curr!=NULL) { if(curr->next->x==x&&!tst) { curr->next=temp; free(delte); tst=1; } curr=curr->next; } } curr=curr->next; } } } void print() { curr=head; while(curr!=NULL) { printf("%3d ", curr->x); curr=curr->next; } printf("\n\n*Press any key to continue*"); getch(); } void main() { int menu=0; int y=0; int z=0; while(menu!=6) { clrscr(); printf("\t\t*MENU*\n"); printf("1. Input for the Linked List\n"); printf("2. Sort the Linked List\n"); printf("3. Insert a Node \n"); printf("4. Delete a Node\n"); printf("5. Print\n"); printf("6. Exit\n"); scanf("%d", &menu); switch(menu) { case 1: input(); y=1; break; case 2: if(y) sort(); else { printf("\nNo Input Yet!"); getch(); } z=1; break; case 3: if(y||z) if(y&&z) insrt(); else { printf("\nNo Input Yet or Not Yet Sorted!"); getch(); } break; case 4: if(y&&z) delet(); else { printf("\nNo Input Yet or Not Yet Sorted!"); getch(); } break; case 5: if(y) print(); else { printf("\nNo Input Yet!"); getch(); } break; case 6: printf("\nOk Goodbye! :)"); break;

default: printf("\n\nInvalid Input!");break; } }getch(); }