Составьте блок-схему алгоритма пожалуйста, буду благодарен

[336209]

#include <iostream>
#include <cmath>
#include <iomanip>

double f(double x, double eps, int &n){

double ds = x;
double sum = ds;
n = 0;
while(fabs(ds) > eps){

++n;
ds *= x*x*(2*n - 1)/(2*n + 1.);
sum += ds;
}
++n;
return 2*sum;
}

using namespace std;

int main(){

double xn, xk, dx, eps;
do{
cout << "xn = ";
cin.clear();
cin.sync();
cin >> xn;
}while(cin.fail() || fabs(xn) >= 1);

do{
cout << "xk = ";
cin.clear();
cin.sync();
cin >> xk;
}while(cin.fail() || xk < xn || 1 <= xk);

do{
cout << "dx = ";
cin.clear();
cin.sync();
cin >> dx;
}while(cin.fail() || fabs(dx) >= 1);

do{
cout << "eps = ";
cin.clear();
cin.sync();
cin >> eps;
}while(cin.fail());

for (double x = xn; x < xk + dx/2; x += dx){

int n;
cout << setw(5) << fixed << setprecision(2) << x;
cout << setw(10) << fixed << setprecision(5) << f(x, eps, n);
cout << setw(10) << fixed << setprecision(5) << log((1 + x)/(1 - x));
cout << setw(5) << n << endl;
}
system("pause");
return 0;
}