(304 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 |

- How to sort Text file content in Java [127 Views]
- Create a Compressed Zip File in Java [131 Views]
- Difference between #define and const in C [199 Views]
- Binary Tree Program implementation in C++ [33 Views]
- Pseudocode and Algorithm for Sequential Search or Linear Search [994 Views]

- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [6536 Views]
- Pseudocode and Algorithm to find whether number is Armstrong Number or Not [5331 Views]
- How To Win Ludo King Game Every Time [5081 Views]
- error: Multiple commands produce error in Xcode 10 [4062 Views]
- Create Dynamic Pagination using Java Spring Boot, Hibernate and MySQL [3286 Views]