Polynomial using Lists ppt presentation in c

polymerisation ppt concept

1. Polynomial Addition using Linked Lists K Mahesh

2. struct node { int co, expo; struct node* next; };

3. struct node* polyCreate ( struct node* head, int co, int expo) { struct node *temp, * newNode ; newNode = ( struct node *) malloc ( sizeof ( struct node)); newNode ->co = co; newNode ->expo = expo; newNode ->next = NULL; //if polynomial empty. make the node the head node if(head == NULL) { head = newNode ; } else // else go to the last node and append { temp = head; while(temp->next != NULL) temp = temp->next; temp->next = newNode ; } return head; }

4. void polyDisplay ( struct node* head) { struct node *temp=head; while(temp != NULL) { if(temp->co >= 0) printf ("+%d^%d", temp->co, temp->expo); else printf ("%d^%d", temp->co, temp->expo ); temp=temp->next; } printf ("\n"); }

5. Polynomial Addition