c/c++|Neton-Cotes方法

最新推荐文章于 2024-09-25 21:49:38 发布

Lhw_666

最新推荐文章于 2024-09-25 21:49:38 发布

阅读量240

点赞数

文章标签：算法 Newton-Cotes c++

本文链接：https://blog.csdn.net/Lhw_666/article/details/110517639

版权

在这里插入图片描述

#include <bits/stdc++.h>
using namespace std;
#define MAXSIZE 7
int main(){
    double x[MAXSIZE], y[MAXSIZE];
    long c[MAXSIZE][MAXSIZE/2+2] = {{2, 1}, {6, 1, 4}, {8, 1, 3},
                                    {90, 7, 32, 12}, {288, 19, 75, 50},
                                    {840, 41, 216, 27, 272},
                                    {17280, 751, 3577, 1323, 2989}};
    double a, b;
    int n;
    double result = 0.0;
    cout << "请输入积分区间边界:";
    cin >> a >> b;
    cout << "请输入积分节点的个数:";
    cin >> n;
    for (int i = 0; i < n; i++) {
        cout << "请输入求积节点坐标x[" << i << "], y[" << i << "]:";
        cin >> x[i] >> y[i];
    }
    int loc = n-2;
    int end = loc/2+loc%2+1;
    for (int i = 0; i < n/2; i++) {
        result += c[loc][i+1]*(y[i]+y[n-i-1]);
    }
    if(n%2){
        result += c[loc][end]*y[n/2];
    }
    result = result*(b-a)/c[loc][0];
    printf("积分值为: %lf\n", result);
}