以列为主.ppt

Data Structure in C  ─ 陣列與結構;大綱;陣列;陣列的抽象資料型態(ADT:abstract data type)(是一種資料型態，它的組織方式使得物件的規格與物件上的運算之規格和該物件的內部表示法與運算的實作法是獨立的);二維陣列;三維陣列;三維陣列 (續);三維陣列 (續);n維陣列;結構和聯結;結構和聯結;多項式抽象資料型態;多項式的ADT;在C中表示多項示的方法是使用typedef建立polynomial型態 #define MAX_DEGREE 101 /*Max degree of polynomial+1*/ typedef struct{ int degree; float coef[MAX_DEGREE]; } polynomial; ? 若a的型態是polynomial，且nMAX_DEGREE， 則多項式A(x)= 可表示為： a.degree=n a.coef[i]=an-i, 0 i n;多項式抽象資料型態 (續);多項式抽象資料型態 (續);void padd (int starta, int finisha, int startb, int finishb, int *stard, int *finishd) { /* add A(x) and B(x) to obtain D(x) */ float coefficient; *startd=avail; while (starta= finisha startb = finishb) switch(COMPARE(terms[starta].expon, terms[startb].expon)) { case –1: /* a expon b expon*/ attach(terms[startb].coef, terms[startb].expon); startb++; break; case 0: /* equal exponents*/ coefficient = terms[starta].coef+terms[startb].coef;; if (coefficient) attach(coefficient, terms[starta].expon); starta++; startb++; break; case –1: /* a expon b expon*/ attach(terms[starta].coef, terms[starta].expon); starta++; break; } /* add in remaining terms of A(x)*/ for( ; starta=finisha; starta++) attach(terms[starta].coef, terms[starta].expon); /* add in remaining terms of B(x)*/ for( ; startb=finishb; startb++) attach(terms[startb].coef, terms[startb].expon); *finishd=avail-1; };void attach(float coefficient, int exponent) { /* add a new term to the polynomial*/ if(avail=MAX_TERMS) { fprintf(stderr,”Too many terms in the polynomial\n”);