本文介绍了C ++中的OOP多项式编程的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
我需要提交有关C ++多项式的作业(截止日期为2011年9月26日),并包含所有标头(hpp),cpp.我已经给出了主文件,并且可以在下面找到它
hi i need to submit my assignment(due 9/26/2011) on polynomial in C++ with all header(hpp),cpp.I have already given main file and u can find it below
/*
Polynomial_s.cpp
Syntax checking of the interface of a Polynomial class
*/
#include "Polynomial.hpp"
#include <iostream>
#include <cassert>
#include <vector>
int main() {
Polynomial q;
Polynomial q2 = q;
Polynomial q3(q);
q2 = q;
// constant constructor
Polynomial c(5);
// output
std::cout << c << '\n';
// equality
c == c;
// inequality
c != c;
// addition
Polynomial a1(2);
Polynomial a2(3);
Polynomial a3(5);
a1 += a2;
assert(a1 == a3);
assert(a1 == 5);
// access coefficients based on degree of term
a3.coefficient(0);
// linear constructor
Polynomial l(2, -3);
assert(l.coefficient(0) == 2);
assert(l.coefficient(1) == -3);
// quadratic constructor
Polynomial quad(1, 0, -1);
assert(quad.coefficient(0) == 1);
assert(quad.coefficient(1) == 0);
assert(quad.coefficient(2) == -1);
// vector constructor
std::vector<double> coeffs(4);
coeffs[0] = 1; coeffs[1] = 0; coeffs[2] = -1;
Polynomial poly(coeffs);
// c-array constructor
double acoeffs[] = { 1, 0, -1 };
Polynomial polya(acoeffs, 3);
// factoring
std::vector<polynomial> factors = polya.factor();
return 0;
}
推荐答案
这篇关于C ++中的OOP多项式编程的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持!