Методы вычислений 02.09.22

#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;

const double EPS = 1e-4;

double f[18];

int main()
{
    cout << fixed << setprecision(10);

    double x = 0.0, h = 0.1;

    for (int i = 0; i < 18; ++i, x += h)
    {
        double u0 = 1.0, sum = 0.0;

        // cout << "u0 = " << u0 << "\n"; ПРОВЕРКА

        int k = 0;

        while (fabs(u0) > EPS)
        {
            sum += u0;
            u0 *= (-x) / (2 * k + 1) / (2 * k + 2);

            // cout << "u0 = " << u0 << "\n"; ПРОВЕРКА

            ++k;
        }

        f[i] = sum;
    }

    cout << left << setw(15) << "x" << setw(15) << "f(x)" << setw(15) << "right" << setw(15) << "left" << setw(15) << "center" << "\n";

    x = 0;

    cout << left << setw(15) << x << setw(15) << f[0] << setw(15) << (f[1] - f[0]) / h << setw(15) << "-----" << setw(15) << "-----" << "\n";

    x += h;

    for (int i = 1; i < 17; ++i, x += h)
    {
        cout << left << setw(15) << x << setw(15) << f[i] << setw(15) << (f[i + 1] - f[i]) / h << setw(15) << (f[i] - f[i - 1]) / h << setw(15) << (f[i + 1] - f[i - 1]) / 2 / h << "\n";
    }

    cout << left << setw(15) << x << setw(15) << f[17] << setw(15) << "-----" << setw(15) << (f[17] - f[16]) / h << setw(15) << "-----" << "\n";

    return 0;
}