construct a trace table for the following algorithm : boolean PRIME(int NUMBER) FACTOR = 2 FOUND = false P = false loop while (FACTOR * FACTOR) <= NUMBER AND NOT FOUND if NUMBER mod FACTOR = 0 then FOUND = true end if FACTOR = FACTOR + 1 end loop P = NOT
construct a trace table for the following algorithm : boolean PRIME(int NUMBER) FACTOR = 2 FOUND = false P = false loop while (FACTOR * FACTOR) <= NUMBER AND NOT FOUND if NUMBER mod FACTOR = 0 then FOUND = true end if FACTOR = FACTOR + 1 end loop P = NOT
Register to vote on and add code examples. Join our developer community to improve your dev skills and code like a boss!
No Good?
Help us improve our code examples by registering to vote on and add answers. Join our developer community to improve your dev skills and code like a boss!