/* Polynomial Expressions Using Linked List*/ #include<stdio.h> #include<conio.h> #include <malloc.h> struct node. int num; int coeff;

Size: px

Start display at page:

Download "/* Polynomial Expressions Using Linked List*/ #include<stdio.h> #include<conio.h> #include <malloc.h> struct node. int num; int coeff;"

Herbert Horn
6 years ago
Views:

1 /* Polynomial Expressions Using Linked List*/ #include<stdio.h> #include<conio.h> #include <malloc.h> struct node int num; int coeff; struct node *next; ; struct node *start1 = NULL; struct node *start2 = NULL; struct node *start3 = NULL; struct node *start4 = NULL; struct node *create_poly(struct node *); struct node *display_poly(struct node *); struct node *add_poly(struct node *,struct node *,struct node *); struct node *sub_poly(struct node *,struct node *,struct node *); struct node *add_node(struct node *,int, int); void main() 1 P a g e

2 2 P a g e int op; clrscr(); do printf("\n***main menu***\n"); printf("\n1. Enter first polynomial"); printf("\n2. Display the first polynomial"); printf("\n3. Enter second polynomial"); printf("\n4. Display the second polynomial"); printf("\n5. Add the polynomials"); printf("\n6. Display the result"); printf("\n7. Subtract the polynomials"); printf("\n8. Display the result"); printf("\n9. Exit"); printf("\n Enter your option : "); scanf("%d", &op); switch(op) case 1: start1 = create_poly(start1); case 2: start1 = display_poly(start1); case 3: start2 = create_poly(start2);

3 case 4: start2 = display_poly(start2); case 5: start3 = add_poly(start1, start2, start3); case 6: start3 = display_poly(start3); case 7: start4 = sub_poly(start1, start2, start4); case 8: start4 = display_poly(start4); while(op!=9); getch(); struct node *create_poly(struct node *start) struct node *new_node, *ptr; int n, c; printf("\n Enter the number : "); scanf("%d", &n); printf("\t Enter its coefficient : "); scanf("%d", &c); while(n!= -1) 3 P a g e

4 4 P a g e if(start==null) new_node = (struct node *)malloc(sizeof(struct node)); new_node->num = n; new_node->coeff = c; new_node->next = NULL; start = new_node; else ptr = start; while(ptr->next!= NULL) ptr = ptr->next; new_node = (struct node *)malloc(sizeof(struct node)); new_node->num = n; new_node->coeff = c; new_node->next = NULL; ptr->next = new_node; printf("\n Enter the number : "); scanf("%d", &n); if(n == -1)

5 printf("\t Enter its coefficient : "); scanf("%d", &c); return start; struct node *display_poly(struct node *start) struct node *ptr; ptr = start; while(ptr!= NULL) printf("\n %d * %d \t", ptr->num, ptr->coeff); ptr = ptr->next; return start; struct node *add_poly(struct node *start1,struct node *start2,struct node *start3) struct node *ptr1, *ptr2; int sum_num, c; ptr1 = start1, ptr2 = start2; 5 P a g e

6 6 P a g e while(ptr1!= NULL && ptr2!= NULL) if(ptr1->coeff == ptr2->coeff) sum_num = ptr1->num + ptr2->num; start3 = add_node(start3, sum_num, ptr1->coeff); else if(ptr1->coeff > ptr2->coeff) start3 = add_node(start3, ptr1->num, ptr1->coeff); else if(ptr1->coeff < ptr2->coeff) start3 = add_node(start3, ptr2->num, ptr2->coeff); if(ptr1 == NULL) while(ptr2!= NULL)

7 start3 = add_node(start3, ptr2->num, ptr2->coeff); if(ptr2 == NULL) while(ptr1!= NULL) start3 = add_node(start3, ptr1->num, ptr1->coeff); return start3; struct node *sub_poly(struct node *start1,struct node *start2,struct node *start4) struct node *ptr1, *ptr2; int sum_num, c; ptr1 = start1, ptr2 = start2; do if(ptr1->coeff == ptr2->coeff) 7 P a g e

8 8 P a g e sum_num = ptr1->num - ptr2->num; start4 = add_node(start4, sum_num, ptr1->coeff); else if(ptr1->coeff > ptr2->coeff) start4 = add_node(start4, ptr1->num, ptr1->coeff); else if(ptr1->coeff < ptr2->coeff) start4 = add_node(start4, ptr2->num, ptr2->coeff); while(ptr1!= NULL ptr2!= NULL); if(ptr1 == NULL) while(ptr2!= NULL) start4 = add_node(start4, ptr2->num, ptr2->coeff);

9 if(ptr2 == NULL) while(ptr1!= NULL) start4 = add_node(start4, ptr1->num, ptr1->coeff); return start4; struct node *add_node(struct node *start,int n, int c) struct node *new_node, *ptr; if(start==null) new_node = (struct node *)malloc(sizeof(struct node)); new_node->num = n; new_node->coeff = c; new_node->next = NULL; start = new_node; else 9 P a g e

10 ptr = start; while(ptr->next!= NULL) ptr = ptr->next; new_node = (struct node *)malloc(sizeof(struct node)); new_node->num = n; new_node->coeff = c; new_node->next = NULL; ptr->next = new_node; return start; 10 P a g e

INSERT AS A FIRST NODE

CIRCULAR LINKED LIST Insert as a first node Insert as a last node Delete first node Delete last node Insert after a node Insert before a node Search Traverse INSERT AS A FIRST NODE void insertf() struct