covert algorithm to code java

Question

INPUT initial approximation p0; tolerance TOL; maximum number of iterations N0.

OUTPUT approximate solution p or message of failure.

Step 1 Set i = 1.

Step 2 While i ≤ N0 do Steps 3–6.

Step 3 Set p = p0 − f ( p0)/f

( p0). (Compute pi.)

Step 4 If | p − p0| < TOL then

OUTPUT (p); (The procedure was successful.)

STOP.

Step 5 Set i = i + 1.

Step 6 Set p0 = p. (Update p0.)

Step 7 OUTPUT (‘The method failed after N0 iterations, N0 =’, N0);

(The procedure was unsuccessful.)

STOP.

Answer 1

I'm not sure what "f" is in step 3 of your algorithm. It looks like a function when you write "...f ( p0)...", but it looks like a variable when you write ".../f". Otherwise, this is pretty easy to write using a for loop (or while loop), and an if statement.