Algorithms_in_C++
1.0.0
Set of algorithms implemented in C++.
|
Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime. More...
#include <cassert>
#include <iostream>
Functions | |
template<typename T > | |
bool | is_prime (T num) |
int | main () |
Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime.
Copyright 2020
A simple program to check if the given number if prime or not.
bool is_prime | ( | T | num | ) |
Function to check if the given number is prime or not.
num | number to be checked. |
int main | ( | void | ) |
Main function