i七个程序.docVIP

多项式相加 HW1 p.79 3.6 Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation. If the polynomials have M and N terms, respectively, what is the time complexity of your program? #include stdio.h #include stdlib.h #define COMPARE(numa,numb) (numanumb?-1:(numanumb?1:0)) typedef struct Node *PtrToNode; struct Node { int Coefficient; int Exponent; PtrToNode Next; }; typedef PtrToNode Polynomial; Polynomial Create(char * filename) { FILE * file; int coefficient; int exponent; int val; PtrToNode front, tail, temp; tail = (PtrToNode)malloc(sizeof(struct Node)); if (tail == NULL) { printf(The memory is full!\n); exit(1); } front = tail; front-Exponent = -1; file = fopen(filename, r); if (file == NULL) { printf(Cantt open %s!\n, filename); exit(1); } while (!feof(file)) { val = fscanf(file, %d, %d, coefficient, exponent); printf(val = %d\n, val); if (exponent -1) { printf(In File %s: the exponent of polynomial is not less than 0!\n, filename); exit(1); } temp = (PtrToNode)malloc(sizeof(struct Node)); if (temp == NULL) { printf(The memory is full!\n); exit(1); } temp-Coefficient = coefficient; temp-Exponent = exponent; temp-Next = NULL; tail-Next = temp; tail = temp; } fclose(file); return front; } void Output(Polynomial poly, char * filename) { FILE * file; file = fopen(filename, w); PtrToNode curNode = poly-Next; if (file == NULL) { printf(Cantt open %s!\n, filename); exit(1); } while (curNode != NULL) { fprintf(file, %d,%d\n,curNode-Coefficient,curNode-Exponent); curNode = curNode-Next; } fclose(file); } void Attach(int coefficient, int exponent, PtrTo