多项式ADT加法乘法——数组实现

/*
  多项式ADT数组实现
*/


/*接口声明*/
#ifndef _POLYNOMIAL_H
#define _POLYNOMIAL_H

#define MaxDegree 100      //指定多项式的最大指数

struct node
{
    int CoeffArray[ MaxDegree + 1 ];
    int HighPower;
};

struct node * Polynomial;

/*操作集*/

/*将多项式初始化为零*/
void ZeroPolynomial( Polynomial Poly );

/*两个多项式相加*/
void AddPolynomial( const Polynomial Poly1, const Polynomial Poly2, Polynomial PolySum );

/*两个多项式相乘*/
void MulPolynomial( const Polynomial Poly1, const Polynomial Poly2, PolyNomial PolyProd );




/*接口实现*/
#include <stdlib.h>
#include "polynomial.h"

int Max( int A, int B );

void ZeroPolynomial( Polynomial Poly )
{
    for ( int i = 0; i <= MaxPolynomial; i++ )
        Poly->CoeffArray[ i ] = 0;
    Poly->HighPower = 0;
}

void AddPolynomial( const Polynomial Poly1, const Polynomial Poly2, Polynomial PolySum )
{
    ZeroPolynomial( PolySum );
    PolySum->HighPower = Max( Poly1->HighPower, Poly2->HighPower );
    
    while ( int i = PolySum->HighPower; i >= 0; i-- )
        PolySum->CoeffArray[ i ] = Poly1->CoeffArray[ i ] + Poly2->CoeffArray[ i ];
}

void MulPolynomial( const Polynomial Poly1, const Polynomial Poly2, Polynomial PolyProd )
{
    PolyProd->HighPower = Poly1->HighPower + Poly2->HighPower;
    if ( PolyProd->HighPower > MaxDegree )
    {
        printf( "数组溢出，退出程序
" );
        exit( 1 );
    }
    
    for ( int i = 0; i <= Poly1->HighPower; i++ )
        for ( int j = 0; j <= Poly2->HighPower; j++ )
            PolyProd->CoeffArray[ i + j ] += Poly1->CoeffArray[ i ] * Poly2->CoeffArray[ j ];
}

int Max( int A, int B )
{
    return A > B ? A : B;
}