Task 4 is done!
This commit is contained in:
parent
62add41f64
commit
22ef2dda9b
18 changed files with 332 additions and 48 deletions
|
|
@ -10,7 +10,7 @@
|
|||
int main(int argc, char *argv[])
|
||||
{
|
||||
double t, a, b, eps, x = 0;
|
||||
int m, k, cl, it = 0, task = 1;
|
||||
int m, k, cl, it = 0, task = 4;
|
||||
status ret;
|
||||
|
||||
double (*f) (double);
|
||||
|
|
@ -22,7 +22,7 @@ int main(int argc, char *argv[])
|
|||
sscanf(argv[1], "%lf", &a) == 1 &&
|
||||
sscanf(argv[2], "%lf", &b) == 1 &&
|
||||
(a <= b) &&
|
||||
sscanf(argv[3], "%lf", &eps) == 1 &&
|
||||
(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))))
|
||||
) {
|
||||
|
|
@ -33,7 +33,7 @@ int main(int argc, char *argv[])
|
|||
f = f_lst[k];
|
||||
|
||||
t = clock();
|
||||
ret = t1_solve(f, a, b, eps, m, &x, &it);
|
||||
ret = t4_solve(f, a, b, eps, m, &x, &it);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
|
||||
cl = get_call_count();
|
||||
|
|
@ -48,11 +48,8 @@ int main(int argc, char *argv[])
|
|||
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);
|
||||
case EQUAL:
|
||||
fprintf(stderr, "Error: with code %d - The dots degenerated into one!\n", ret);
|
||||
break;
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue