Add Kochubei's solve

2025.05.02/09Ex/Makefile

@@ -0,0 +1,42 @@
+WFLAGS = -fstack-protector-all -W -Wall -Wextra -Wunused \
+-Wempty-body -Wlogical-op -Wold-style-declaration -Wmissing-parameter-type \
+-Wignored-qualifiers -Winit-self -Wshadow -Wtype-limits \
+-Wpointer-arith -Wformat-security -Wmissing-format-attribute -Wformat=1 \
+-Wdeclaration-after-statement -Wbad-function-cast -Wnested-externs \
+-Wmissing-prototypes -Wmissing-declarations -Wold-style-definition \
+-Wcast-align -Werror -pedantic -pedantic-errors -Wfloat-equal \
+-Wwrite-strings -Wno-long-long -std=gnu99 -Wstrict-prototypes \
+-Wmissing-field-initializers -Wpointer-sign
+
+LDFLAGS = -std=gnu99 -mfpmath=sse -O3
+LDLIBS = -lm
+
+ifeq ($(OS),Windows_NT)
+	EXE = exe
+	CLEAN = del
+	LDLIBS += -lssp
+else
+	EXE = out
+	CLEAN = rm -f
+endif
+
+TARGET = a09.$(EXE)
+OBJ = main.o solve.o init_f.o
+
+%.o: %.c
+	gcc $(WFLAGS) $(LDFLAGS) -c $< -o $@
+
+$(TARGET): $(OBJ)
+	gcc $^ -o $@ $(LDLIBS)
+
+# Отладочная сборка (gdb)
+gdb: LDFLAGS = -std=gnu99 -mfpmath=sse -g -O0
+gdb: clean $(TARGET)
+
+# Профилировочная сборка (gprof)
+prof: LDFLAGS += -pg
+prof: LDLIBS += -pg
+prof: clean $(TARGET)
+
+clean:
+	$(CLEAN) *.o *$(EXE)

2025.05.02/09Ex/init_f.c

@@ -0,0 +1,61 @@
+#include "init_f.h"
+
+#include <math.h>
+
+
+static int cl = 0;
+
+int get_call_count (void) 
+{
+	return cl;
+}
+
+double f0 (double x)
+{
+	cl++;
+	(void)x;
+
+	return 1;
+}
+
+double f1 (double x)
+{
+	cl++;
+	return (x * 1e-100) - 1.0;
+}
+
+double f2 (double x)
+{
+	cl++;
+	return 4 - x * x;
+}
+
+double f3 (double x)
+{
+	double x_2 = x * x;
+	cl++;
+
+	return x * x_2 + 3 * x_2 + 16;
+}
+
+double f4 (double x)
+{
+	double x_2 = x * x;
+	cl++;
+
+	return 3 - 2 * x_2 - x_2 * x_2;
+}
+
+double f5 (double x)
+{
+	cl++;
+	return sqrt(fabs(x) + 1) - 2;
+}
+
+double f6 (double x)
+{
+	cl++;
+	return sqrt(sqrt(fabs(x) + 1) + 1) - 2;
+}
+
+

2025.05.02/09Ex/init_f.h

@@ -0,0 +1,13 @@
+#ifndef INIT_F_H
+#define INIT_F_H
+
+int get_call_count (void); 
+double f0 (double x);
+double f1 (double x);
+double f2 (double x);
+double f3 (double x);
+double f4 (double x);
+double f5 (double x);
+double f6 (double x);
+
+#endif

2025.05.02/09Ex/main.c

@@ -0,0 +1,66 @@
+#include <stdio.h>
+#include <time.h>
+#include <math.h>
+
+#include "init_f.h"
+#include "status.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, cl, it = 0, task = 1;
+	status ret;
+	
+	double (*f) (double);
+	double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6, sin}; // TODO: Remove sin
+	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 &&
+			((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();
+	ret = t1_solve(f, a, b, eps, m, &x, &it);
+	t = (clock() - t) / CLOCKS_PER_SEC;
+		
+	cl = get_call_count();
+
+
+	do {
+		switch (ret) 
+		{
+			case SUCCESS:
+				continue;
+			case RUN_TIME:
+				fprintf(stderr, "Error: with code %d - Not enough iterations!\n", ret);
+				break;
+			case MORE_ONE_ROOT:
+				fprintf(stderr, "Error: with code %d - The same signs on the boundaries of the segment!\n", ret);
+				break;
+			case HIGH_ERROR:
+				fprintf(stderr, "Error: with code %d - The solution was found with a high error rate!\n", ret);
+				break;
+		}
+		
+		fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t);
+		return ret;
+	} while (0);
+
+	printf("%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;
+}
+

2025.05.02/09Ex/solve.c

@@ -0,0 +1,68 @@
+#include "solve.h"
+#include "status.h"
+
+#include <math.h>
+#include <float.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include <string.h>
+
+int t9_solve (
+		double (*f) (double), 
+		double a, double b, 
+		double eps, int m, double *x
+) {
+	int it = 0;
+	double c = DBL_MAX, y, y_a = f(a), y_b = f(b);
+
+	if (fabs(y_a) - eps < DBL_EPSILON)
+	{
+		*x = a;
+		return SUCCESS;
+	} if (fabs(y_b) - eps < DBL_EPSILON)
+	{
+		*x = b;
+		return SUCCESS;
+	}
+
+	if (sgn_a == sgn_b)
+	{
+		*x = DBL_MAX;
+		return MORE_ONE_ROOT;
+	}
+	
+	for (it = 0; it < m; ++it)
+	{
+		c = (a + b) * 0.5;
+		y = f(c);
+		
+		memcpy(&bits, &y, sizeof(bits));
+		sgn_c = (bits >> 63) & 1;
+		
+		if (fabs(y) - eps < DBL_EPSILON)
+		{
+			ret = SUCCESS;
+			break;
+		} else if ((fabs(c - a) < DBL_EPSILON) || (fabs(c - b) < DBL_EPSILON))
+		{
+			ret = HIGH_ERROR;
+			break;
+		} else if (sgn_c == sgn_a)
+		{
+			a = c;
+			y_a = y;
+		} else if (sgn_c == sgn_b)
+		{
+			b = c;
+			y_b = y;
+		}
+	}
+	
+	if (it >= m)
+		ret = RUN_TIME;
+	
+	*x = c;
+
+	return ret;
+}
+

2025.05.02/09Ex/solve.h

@@ -0,0 +1,12 @@
+#ifndef SOLVE_H
+#define SOLVE_H
+
+#include "status.h"
+
+status t1_solve (
+		double (*f) (double), 
+		double a, double b, 
+		double eps, int m, double *x, int *m_it
+		);
+
+#endif