Data Structures Using C, 2nd Edition by Pearson

Arrays: Searching and Sorting 141

void dispPol(int pol[])

{

int size;

int i;

size 5 pol[0]*2 + 1;

printf (“\n”);

for (i 5 1; i < size; i + 5 2)

{

printf (“%d*x^%d+”, pol[i], pol[i + 1]);

}

}

We can also choose other data structures to represent polynomials. For instance, a term can be

represented by ‘struct’ construct of ‘C’ as shown below:

struct term

{

int coef;

int exp;

};

and the polynomial called ‘pol’ of ten terms can be represented by an array of structures of type ‘term’

as shown below:

struct term pol1[10];

Now the algorithm merge() can be applied to add two such polynomials with above chosen data

structures. It is left as an exercise ...