A function finds approximate maximum or minimum point of a second degree
polynomial function (the point where the derivation will equal to zero ). The input
polynomial function will be in the following format: x2 + bx + c = 0 . Your C function should
take a , b and c as input parameters. Your C function also should take the
srch_starting_point and stp_sze from the user. Finally, print the resulting
maximum or minimum point (m_x, m_y) and step count (n_step) in your function.
For example, if the input is (a, b, c, srch_starting_point, stp_sze );
1 1 1 -3 1
Output similar to;
Maximum point results ( m_x, m_y, n_step )
-1 1 2
Firstly, I don't have exact idea,but I think i can find the minimum point at first(Using derivation). After choosing starting point, staating point gets lower step size by step size. I can compare numbers to the minimum number(Absolutely I don't any idea I've mentioned it in the post ) Afterwards, to find m_y i put m_x in the function. Finally, I put a counter to count steps.
If you anyone has easier idea please share. Thank you all appreciated answers.