Task 9 is done
This commit is contained in:
parent
a8b4e4358d
commit
cdc405551d
11 changed files with 328 additions and 1 deletions
2
2025.05.02/dist/Krivoruchenko_SK/Makefile
vendored
2
2025.05.02/dist/Krivoruchenko_SK/Makefile
vendored
|
|
@ -5,7 +5,7 @@ FLAGS = -fstack-protector-all -W -Wall -Wextra -Wunused -Wcast-align -Werror -pe
|
|||
%.o: %.c
|
||||
gcc -c $(FLAGS) $<
|
||||
|
||||
all: a01.out a02.out a03.out a04.out a07.out a08.out
|
||||
all: a01.out a02.out a03.out a04.out a07.out a08.out a09.out
|
||||
|
||||
solve.o: solve.c solve.h
|
||||
init_f.o: init_f.c init_f.h
|
||||
|
|
|
|||
49
2025.05.02/dist/Krivoruchenko_SK/a09.c
vendored
Normal file
49
2025.05.02/dist/Krivoruchenko_SK/a09.c
vendored
Normal file
|
|
@ -0,0 +1,49 @@
|
|||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
#include <math.h>
|
||||
|
||||
#include "init_f.h"
|
||||
#include "solve.h"
|
||||
|
||||
/* ./a.out a b eps M k */
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
double t, a, b, eps, x = 0;
|
||||
int m, k, it, cl, task = 9;
|
||||
|
||||
double (*f) (double);
|
||||
double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6};
|
||||
int len_f = sizeof(f_lst) / sizeof(f_lst[0]);
|
||||
|
||||
if (
|
||||
!((argc == 6) &&
|
||||
sscanf(argv[1], "%lf", &a) == 1 &&
|
||||
sscanf(argv[2], "%lf", &b) == 1 &&
|
||||
(a <= b) &&
|
||||
(sscanf(argv[3], "%lf", &eps) == 1 && (eps >= 0)) &&
|
||||
((sscanf(argv[4], "%d", &m) == 1) && m > 0) &&
|
||||
((sscanf(argv[5], "%d", &k) == 1) && ((0 <= k) && (k <= len_f))))
|
||||
) {
|
||||
fprintf(stderr, "Usage: %s a b eps M k\n", argv[0]);
|
||||
return -1;
|
||||
}
|
||||
|
||||
f = f_lst[k];
|
||||
|
||||
t = clock();
|
||||
it = t9_solve(f, a, b, eps, m, &x);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
|
||||
cl = get_call_count();
|
||||
|
||||
if (it < 0)
|
||||
{
|
||||
fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t);
|
||||
return -2;
|
||||
} else
|
||||
{
|
||||
fprintf(stdout, "%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t);
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
46
2025.05.02/dist/Krivoruchenko_SK/solve.c
vendored
46
2025.05.02/dist/Krivoruchenko_SK/solve.c
vendored
|
|
@ -293,3 +293,49 @@ int t8_solve (
|
|||
|
||||
return it;
|
||||
}
|
||||
|
||||
int t9_solve (
|
||||
double (*f) (double),
|
||||
double a, double b,
|
||||
double eps, int m, double *x
|
||||
) {
|
||||
const double gdrt = 2 / (1 + sqrt(5));
|
||||
int it = 0;
|
||||
|
||||
double x_1 = b + (a - b) * gdrt, x_2 = a + (b - a) * gdrt;
|
||||
double y_1 = f(x_1), y_2 = f(x_2);
|
||||
|
||||
for (it = 1; it <= m; ++it)
|
||||
{
|
||||
if (y_1 - y_2 > DBL_EPSILON)
|
||||
{
|
||||
b = x_2;
|
||||
|
||||
x_2 = x_1;
|
||||
y_2 = y_1;
|
||||
|
||||
x_1 = b + (a - b) * gdrt;
|
||||
y_1 = f(x_1);
|
||||
} else
|
||||
{
|
||||
a = x_1;
|
||||
|
||||
x_1 = x_2;
|
||||
y_1 = y_2;
|
||||
|
||||
x_2 = a + (b - a) * gdrt;
|
||||
y_2 = f(x_2);
|
||||
}
|
||||
|
||||
if (fabs(b - a) < eps)
|
||||
{
|
||||
*x = x_1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (it > m)
|
||||
it = -1;
|
||||
|
||||
return it;
|
||||
}
|
||||
|
|
|
|||
6
2025.05.02/dist/Krivoruchenko_SK/solve.h
vendored
6
2025.05.02/dist/Krivoruchenko_SK/solve.h
vendored
|
|
@ -38,4 +38,10 @@ int t8_solve (
|
|||
double eps, int m, double *x
|
||||
);
|
||||
|
||||
int t9_solve (
|
||||
double (*f) (double),
|
||||
double a, double b,
|
||||
double eps, int m, double *x
|
||||
);
|
||||
|
||||
#endif
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue