Question: please answer questions 1, 2 & 3 1. Glven an integer input n, write an algorithm in Coral to check if the number is a

1. Glven an integer input n, write an algorithm in Coral to check if the number is a prime number. Put "Prime" to output if n is prime, and put "Not Prime" if it is not. 2. Below is a modified searching algorithm that eliminates the use of the flag but achieves the same behavior: Cl Deelise and read inpets intregor a integer) integer array(z) A integer 1 n= Qet next input x - Cet next input A. esize =B 1=0 vhile (i
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
