| 410 |
|
l_max(char *nm) /* general maximum function */ |
| 411 |
|
{ |
| 412 |
|
int n = nargum(); |
| 413 |
– |
int i = 1; |
| 413 |
|
double vmax = argument(1); |
| 414 |
|
|
| 415 |
< |
while (i++ < n) { |
| 416 |
< |
double v = argument(i); |
| 415 |
> |
while (n > 1) { |
| 416 |
> |
double v = argument(n--); |
| 417 |
|
if (vmax < v) |
| 418 |
|
vmax = v; |
| 419 |
|
} |
| 425 |
|
l_min(char *nm) /* general minimum function */ |
| 426 |
|
{ |
| 427 |
|
int n = nargum(); |
| 429 |
– |
int i = 1; |
| 428 |
|
double vmin = argument(1); |
| 429 |
|
|
| 430 |
< |
while (i++ < n) { |
| 431 |
< |
double v = argument(i); |
| 430 |
> |
while (n > 1) { |
| 431 |
> |
double v = argument(n--); |
| 432 |
|
if (vmin > v) |
| 433 |
|
vmin = v; |
| 434 |
|
} |