SCHOOL OF CODE BUILDERS
Learn To CODE. Become A DEVELOPER.
Pages
HOME
DATA STRUCTURES
STRINGS
ARRAYS
MATRIX
BINARY TREES
LINKED LIST
STACK
QUEUE
SORTING
SEARCHING
C
PYTHON
PSEUDOCODE
CONTEST PROBLEMS
ALGORITHMS
PATTERNS
PHP
C PUZZLES
C INTERVIEW QUESTIONS
JAVA
C++
HASHING
RECURSION
BASIC C PROGRAMS
TCS-CODEVITA
FACEBOOK
CONTACT US
To Check for a Prime Number
To Check for a Prime Number
CheckPrime Function (): Read an integer N if N <= 1 : return 0 else if N <= 3 && N > 1 : return 1 else if N % 2 == 0 || N % 3 == 0: return 0 else set i = 5 do until i * i <= N : if N % i == 0 || N % ( i +2 ) == 0 : return 0 i = i + 6 end loop return 1
PREVIOUS
NEXT
HOME