(1203 Views)

A prime number is a number which is divisible by only two numbers: 1 and itself. So, if any number is divisible by any other number, it is not a prime number.

When you run the program, the output will be:

In the above program, checkPrime function takes 'no' as parameter to check whether it is prime or not. In the loop x value changes from 2 to (no/2). In every iteration, we check if the number is divisible by x, if yes directly come out of the loop and obviously value of x will be less than (no/2), else continue with the iteration until the last element i.e (no/2). After that we just check if the value of x is greater than (no/2), if yes return true else return false.

In showMessage Function, we pass the Value to be checked using Result(13) and store the boolean result in 'answer' variable. Then based on the value returned by checkPrime function, we just print either "Is Prime" or "Not Prime"

3 UpvotesUpvote |
0 DownvotesDownvote |

- Can a where Clause be used along with a Truncate command [942 Views]
- Flowchart and Algorithm for Tower of Hanoi [2745 Views]
- Rat in A Maze Problem Algorithm and Flowchart [1690 Views]
- Floyd Warshalls Algorithm [656 Views]
- Flowchart and Algorithm for Converting Infix to Postfix notation [2443 Views]

- How To Win Ludo King Game Every Time [23510 Views]
- Algorithm to find whether number is Armstrong Number or Not [22751 Views]
- Jio Phone hang on LOGO problem Solution - Hard Reset Jio Phone [15211 Views]
- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [14598 Views]
- FlowChart and Algorithm to find Whether a Number is Even or Odd [11424 Views]