I wrote the code for the task, but it is not executed as it should be, add or suggest what should be written so that it work

Question

Here is the condition of the problem

10 Calculate the product of the minimum and maximum values ​​of the function. Number of argument values ​​n=19. The y argument changes from an initial value of 0.1 in steps of 0.75 (radians):
g = 1+c/(b-y)sin³(y)
c = 3452
b = 1673
#include <stdio.h>
#include <math.h>

[[double funcg(double,double, double);]]

int main()
{
int i, n, nmax;
double b,c,y,ystep;
double xmin, xmax;
double g;
double x;
n=1;
nmax=19;
b=1.673;
c=3.452;
y=0.1;
ystep=0.75;
xmin=xmax=funcg(b,c,y);

printf("Результат\n");
for (i = n; i <= nmax; i++)
{
y=y+ystep;
g=funcg(b,c,y);
if (xmin>g) xmin=g;
if (xmax<g) xmax=g;
printf("Аргумент %4.3f, Min %4.3f, Max %4.3f \n", y, xmin, xmax);

}
x=xmin*xmax;
printf("xMin= %4.3f, xMax= %4.3f \n", xmin, xmax);
printf("Результат = %4.3f \n", x);
return 0;
}

[[double funcg(double b, double c, double y) ]]
{
[[double g;]]
g=(1+c/((b-y)*pow(sin(y),3)));
return g;
}

Answer 1

How it should work? What is your expected output?

Answer 2

what is the correct cycle according to you?
y value is different in each cycle. Other values depends on your calculations.
g value is also different.

You are taking b=1.673 , c = 3.452 but description says to use b=1673, c = 3452. which one is correct??!!

Answer 3

Sry still not clear to me.. Marjan Borodaki
What is a certain point it strucking according to you..? And upto where you want to continue..?

Your loop runs from i=n to nmax times.. In each iteration, it calling funcg() and getting results...

So it can be, only determined correct solution if you know the correct output...! Hope you understand ...

Answer 4

Are you need to deal with integers?

Answer 5

How to add code without (double) so it does the same thing. I've enclosed them with double square brackets [[ ]]

Answer 6

The cycle is not correctly executed, here a few times the same number falls out, but there should be the correct cycle.

Answer 7

the form is not important here, the main thing is that the cycle is performed correctly, that is, find the maximum and minimum value of the cycle, and their product. The problem is that the cycle gets stuck until a certain number and does not continue.
what can this line be replaced with, because it does not work correctly
[[funcg(double,double, double);]].