65 lines
No EOL
1.6 KiB
C
65 lines
No EOL
1.6 KiB
C
#include <stdio.h>
|
||
#include <time.h>
|
||
#include "solve.h"
|
||
#include "make_f.h"
|
||
|
||
int main(int argc, char*argv[]){ // ЧОТА НУЖНО С ПРОИЗВОДНОЙ СДЕЛАТЬ
|
||
int m, k;
|
||
double t, res;
|
||
int ret;
|
||
double x0, eps;
|
||
double (*f)(double);
|
||
double (*df)(double);
|
||
if (!(argc == 5 && sscanf(argv[1], "%lf", &x0) == 1 && sscanf(argv[2], "%lf", &eps) == 1 && sscanf(argv[3], "%d", &m) == 1 && sscanf(argv[4], "%d", &k) == 1)){
|
||
printf("Usage %s\n", argv[0]);
|
||
return 1;
|
||
}
|
||
if (!(0 <= k && k <= 6)){
|
||
printf("k - number of formula doesn't match options\n");
|
||
return 2;
|
||
}
|
||
if (m <= 0){
|
||
printf("Number of iterations must be positive number\n");
|
||
return 3;
|
||
}
|
||
switch (k){
|
||
case (0):
|
||
f = f0;
|
||
df = df0;
|
||
break;
|
||
case (1):
|
||
f = f1;
|
||
df = df1;
|
||
break;
|
||
case (2):
|
||
f = f2;
|
||
df = df2;
|
||
break;
|
||
case (3):
|
||
f = f3;
|
||
df = df3;
|
||
break;
|
||
case (4):
|
||
f = f4;
|
||
df = df4;
|
||
break;
|
||
case (5):
|
||
f = f5;
|
||
df = df5;
|
||
break;
|
||
case (6):
|
||
f = f6;
|
||
df = df6;
|
||
break;
|
||
}
|
||
t = clock();
|
||
ret = task02(f, df, x0, eps, m, &res);
|
||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||
if (ret >= 0){
|
||
printf("%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], 2, res, f(res), ret, c(), t);
|
||
}
|
||
else{
|
||
printf("%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], 2, c(), t);
|
||
}
|
||
return 0;
|
||
} |