AZEN-SGG/2nd_Sem_Bogachev
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Task 2 is done!

Browse source
This commit is contained in:
AZEN-SGG 2025-04-16 12:55:43 +03:00
parent 92a3a951c2
commit b9e4209b86
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
2025.04.18/02Ex/solve.c
View file

@ -14,9 +14,9 @@ double t2_solve (const double x_0, const int n, const double * restrict X, doubl
for (int k = 0; k < n-1; ++k) for (int k = 0; k < n-1; ++k)
{ {
printf ("------- K = %d -------\n", k); // printf ("------- K = %d -------\n", k);
last_y = X[n-1]; last_y = Y[n-1];
for (int i = n-2; i >= k; --i) for (int i = n-2; i >= k; --i)
{ {
const double x_i = X[i-k]; const double x_i = X[i-k];
@ -27,7 +27,7 @@ double t2_solve (const double x_0, const int n, const double * restrict X, doubl
return DBL_MAX; return DBL_MAX;
Y[i+1] = (last_y - y_i) / (last_x - x_i); Y[i+1] = (last_y - y_i) / (last_x - x_i);
printf ("I = %d, f(x%d, ... , x%d) = %lf\n", i, i-k+1, i+2, Y[i+1]); // printf ("I = %d, f(x%d, ... , x%d) = %lf\n", i, i-k+1, i+2, Y[i+1]);
last_y = y_i; last_y = y_i;
} }