backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-08 21:16:26 +08:00
Code Issues Projects Releases Wiki Activity

clang-format and clang-tidy fixes for bd135686

Browse Source
This commit is contained in:
github-actions
2021-10-23 22:16:10 +00:00
parent bd13568664
commit aaeb1815e0
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
math/check_prime.cpp
View File

@@ -7,12 +7,13 @@
* @brief
* 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+6 jumping and check for i or i+2 to be a factor of the number;
* if it's a factor then we will return false otherwise true after the loop terminates at the terminating condition which is (i*i<=num)
* our loop with i+6 jumping and check for i or i+2 to be a factor of the
* number; if it's a factor then we will return false otherwise true after the
* loop terminates at the terminating condition which is (i*i<=num)
*/
#include <cassert> /// for assert
#include <iostream> /// for IO operations
#include <cassert> /// for assert
#include <iostream> /// for IO operations
/**
* Function to check if the given number is prime or not.
@@ -24,14 +25,13 @@ bool is_prime(T num) {
bool result = true;
if (num <= 1) {
return false;
} else if (num == 2 || num==3) {
} else if (num == 2 || num == 3) {
return true;
} else if ((num%2) == 0 || num%3 == 0) {
} else if ((num % 2) == 0 || num % 3 == 0) {
return false;
}
else {
} else {
for (T i = 5; (i * i) <= (num); i = (i + 6)) {
if ((num % i) == 0 || (num%(i+2)==0 )) {
if ((num % i) == 0 || (num % (i + 2) == 0)) {
result = false;
break;
}