diff --git a/d3/d39/check__prime_8cpp__incl.map b/d3/d39/check__prime_8cpp__incl.map index 5ead75d6f..3182c0a4e 100644 --- a/d3/d39/check__prime_8cpp__incl.map +++ b/d3/d39/check__prime_8cpp__incl.map @@ -1,5 +1,5 @@ - + diff --git a/d3/d39/check__prime_8cpp__incl.md5 b/d3/d39/check__prime_8cpp__incl.md5 index a420f358e..2f1889711 100644 --- a/d3/d39/check__prime_8cpp__incl.md5 +++ b/d3/d39/check__prime_8cpp__incl.md5 @@ -1 +1 @@ -2d933c89ad27c996facb165ef26c056e \ No newline at end of file +f4e85a1069174277fa4692078f2fbd27 \ No newline at end of file diff --git a/d3/d39/check__prime_8cpp__incl.svg b/d3/d39/check__prime_8cpp__incl.svg index ef97bcb59..5db80aa75 100644 --- a/d3/d39/check__prime_8cpp__incl.svg +++ b/d3/d39/check__prime_8cpp__incl.svg @@ -21,7 +21,7 @@ Node1 - + math/check_prime.cpp diff --git a/d3/d39/check__prime_8cpp__incl_org.svg b/d3/d39/check__prime_8cpp__incl_org.svg index 699a904bb..b2f9d6468 100644 --- a/d3/d39/check__prime_8cpp__incl_org.svg +++ b/d3/d39/check__prime_8cpp__incl_org.svg @@ -11,7 +11,7 @@ Node1 - + math/check_prime.cpp diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp.html b/d8/ddf/sieve__of__eratosthenes_8cpp.html index 0055c9d14..27ea8303a 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp.html +++ b/d8/ddf/sieve__of__eratosthenes_8cpp.html @@ -118,7 +118,7 @@ Include dependency graph for sieve_of_eratosthenes.cpp: Functions std::vector< bool > sieve (uint32_t N)   -void print (uint32_t N, const std::vector< bool > &is_prime) +void print (uint32_t N, const std::vector< bool > &is_prime)   void tests ()   @@ -152,19 +152,19 @@ Space Complexity : \(O(N)\)

66 tests();
67
68 uint32_t N = 100;
-
69 std::vector<bool> is_prime = sieve(N);
-
70 print(N, is_prime);
+
69 std::vector<bool> is_prime = sieve(N);
+
70 print(N, is_prime);
71 return 0;
72}
-
is_prime
bool is_prime(T num)
for IO operations
Definition check_prime.cpp:24
data_structures::sparse_table::N
constexpr uint32_t N
A struct to represent sparse table for min() as their invariant function, for the given array A....
Definition sparse_table.cpp:47
+
math::is_prime
bool is_prime(int64_t num)
Function to check if the given number is prime or not.
Definition check_prime.cpp:30
sieve
std::vector< bool > sieve(uint32_t N)
Definition sieve_of_eratosthenes.cpp:26
tests
void tests()
Definition sieve_of_eratosthenes.cpp:56
Here is the call graph for this function:
-
+
@@ -203,7 +203,7 @@ Here is the call graph for this function:
44 {
45 for (uint32_t i = 2; i <= N; i++) {
-
46 if (is_prime[i]) {
+
46 if (is_prime[i]) {
47 std::cout << i << ' ';
48 }
49 }
@@ -214,7 +214,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -242,23 +242,18 @@ Here is the call graph for this function:
Returns
is_prime a vector of N + 1 booleans identifying if i^th number is a prime or not
26 {
-
27 std::vector<bool> is_prime(N + 1, true);
-
28 is_prime[0] = is_prime[1] = false;
+
27 std::vector<bool> is_prime(N + 1, true);
+
28 is_prime[0] = is_prime[1] = false;
29 for (uint32_t i = 2; i * i <= N; i++) {
-
30 if (is_prime[i]) {
+
30 if (is_prime[i]) {
31 for (uint32_t j = i * i; j <= N; j += i) {
-
32 is_prime[j] = false;
+
32 is_prime[j] = false;
33 }
34 }
35 }
-
36 return is_prime;
+
36 return is_prime;
37}
-
-Here is the call graph for this function:
-
-
-
- + @@ -284,7 +279,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.map index bb921a9d3..294312e5c 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.map +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.map @@ -1,7 +1,5 @@ - + - - - + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.md5 index 8b64a1ddd..b8c4c957c 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.md5 +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.md5 @@ -1 +1 @@ -647b9e1ec9ccefa6d789728091b5fb67 \ No newline at end of file +3d9d00f1ba8824bdb16502791ed9d494 \ No newline at end of file diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.svg index dec205d98..6806cf750 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.svg +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.svg @@ -4,8 +4,8 @@ - + - + print Node1 - -print + +print @@ -31,8 +31,8 @@ Node2 - -std::endl + +std::endl @@ -40,26 +40,8 @@ Node1->Node2 - - - - - - - -Node3 - - -is_prime - - - - - -Node1->Node3 - - - + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph_org.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph_org.svg index 641ad58f6..648899018 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph_org.svg +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph_org.svg @@ -4,16 +4,16 @@ - - + + print Node1 - -print + +print @@ -21,8 +21,8 @@ Node2 - -std::endl + +std::endl @@ -30,26 +30,8 @@ Node1->Node2 - - - - - - - -Node3 - - -is_prime - - - - - -Node1->Node3 - - - + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.map deleted file mode 100644 index 6643438ce..000000000 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.md5 deleted file mode 100644 index 803895cda..000000000 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -e3268befe64027bd029d60c2b4d28308 \ No newline at end of file diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.svg deleted file mode 100644 index a094f4ab6..000000000 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph.svg +++ /dev/null @@ -1,64 +0,0 @@ - - - - - - - - - - - -sieve - - -Node1 - - -sieve - - - - - -Node2 - - -is_prime - - - - - -Node1->Node2 - - - - - - - - - - - - - diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph_org.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph_org.svg deleted file mode 100644 index 3e62bea5c..000000000 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a7eebd5e7686a8db363f937b2f30d3818_cgraph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -sieve - - -Node1 - - -sieve - - - - - -Node2 - - -is_prime - - - - - -Node1->Node2 - - - - - - - - diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map index 474d61fee..822a7921f 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map @@ -2,6 +2,4 @@ - - diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 index 347843284..0674e85b3 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 @@ -1 +1 @@ -c82de4be074c9901f097cb5a41bddaef \ No newline at end of file +841812c674f8d1523d259f12d986fac2 \ No newline at end of file diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg index 8db7686fb..fbf079c54 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg @@ -4,8 +4,8 @@ - + - + main Node1 - -main + +main Node2 - - -is_prime + + +sieve @@ -40,17 +40,17 @@ Node1->Node2 - - + + Node3 - - -sieve + + +tests @@ -58,26 +58,8 @@ Node1->Node3 - - - - - - - -Node4 - - -tests - - - - - -Node1->Node4 - - - + + @@ -85,17 +67,8 @@ Node3->Node2 - - - - - - - -Node4->Node3 - - - + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index e87e806d6..c58541bab 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,25 +4,25 @@ - - + + main Node1 - -main + +main Node2 - - -is_prime + + +sieve @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -sieve + + +tests @@ -48,26 +48,8 @@ Node1->Node3 - - - - - - - -Node4 - - -tests - - - - - -Node1->Node4 - - - + + @@ -75,17 +57,8 @@ Node3->Node2 - - - - - - - -Node4->Node3 - - - + + diff --git a/db/d93/check__prime_8cpp.html b/db/d93/check__prime_8cpp.html index b5d9a2dad..bfc79ccea 100644 --- a/db/d93/check__prime_8cpp.html +++ b/db/d93/check__prime_8cpp.html @@ -98,12 +98,13 @@ $(document).ready(function(){initNavTree('db/d93/check__prime_8cpp.html','../../
+Namespaces | Functions
check_prime.cpp File Reference
-

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) +

A simple program to check if the given number is Prime or not. More...

#include <cassert>
#include <iostream>
@@ -113,68 +114,30 @@ Include dependency graph for check_prime.cpp:
+ + + + +

+Namespaces

namespace  math
 for IO operations
 
- - - - + + + + + + +

Functions

template<typename T >
bool is_prime (T num)
 for IO operations
 
bool math::is_prime (int64_t num)
 Function to check if the given number is prime or not.
 
static void tests ()
 Self-test implementations.
 
int main ()
 Main function.
 

Detailed Description

-

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)

-

Copyright 2020

Author
omkarlanghe
-

A simple program to check if the given number if prime or not.

+

A simple program to check if the given number is Prime or not.

+

A prime number is any number that can be divided only by itself and 1. It must be positive and a whole number, therefore any prime number is part of the set of natural numbers. The majority of prime numbers are even numbers, with the exception of 2. This algorithm finds prime numbers using this information. additional ways to solve the prime check problem: https://cp-algorithms.com/algebra/primality_tests.html#practice-problems

Author
Omkar Langhe
+
+ewd00010

Function Documentation

- -

◆ is_prime()

- -
-
-
-template<typename T >
- - - - - - - - -
bool is_prime (T num)
-
- -

for IO operations

-

for assert Function to check if the given number is prime or not.

Parameters
- - -
numnumber to be checked.
-
-
-
Returns
if number is prime, it returns @ true, else it returns @ false.
-
24 {
-
25 bool result = true;
-
26 if (num <= 1) {
-
27 return false;
-
28 } else if (num == 2 || num == 3) {
-
29 return true;
-
30 } else if ((num % 2) == 0 || num % 3 == 0) {
-
31 return false;
-
32 } else {
-
33 for (T i = 5; (i * i) <= (num); i = (i + 6)) {
-
34 if ((num % i) == 0 || (num % (i + 2) == 0)) {
-
35 result = false;
-
36 break;
-
37 }
-
38 }
-
39 }
-
40 return (result);
-
41}
-
math::fibonacci_sum::result
uint64_t result(uint64_t n)
Definition fibonacci_sum.cpp:76
-
-
-

◆ main()

@@ -190,32 +153,68 @@ template<typename T >
-

Main function

-
46 {
-
47 // perform self-test
-
48 assert(is_prime(50) == false);
-
49 assert(is_prime(115249) == true);
-
50
-
51 int num = 0;
-
52 std::cout << "Enter the number to check if it is prime or not" << std::endl;
-
53 std::cin >> num;
-
54 bool result = is_prime(num);
-
55 if (result) {
-
56 std::cout << num << " is a prime number" << std::endl;
-
57 } else {
-
58 std::cout << num << " is not a prime number" << std::endl;
-
59 }
-
60
-
61 return 0;
-
62}
- - -
is_prime
bool is_prime(T num)
for IO operations
Definition check_prime.cpp:24
-
std::endl
T endl(T... args)
+ +

Main function.

+
Returns
0 on exit
+
80 {
+
81 tests(); // perform self-tests implementations
+
82 return 0;
+
83}
+
tests
static void tests()
Self-test implementations.
Definition check_prime.cpp:61
Here is the call graph for this function:
-
+
+
+ +
+
+ +

◆ tests()

+ +
+
+ + + + + +
+ + + + + + + +
static void tests ()
+ 		+static
+
+ +

Self-test implementations.

+
Returns
void
+
61 {
+
62 assert(math::is_prime(1) == false);
+
63 assert(math::is_prime(2) == true);
+
64 assert(math::is_prime(3) == true);
+
65 assert(math::is_prime(4) == false);
+
66 assert(math::is_prime(-4) == false);
+
67 assert(math::is_prime(7) == true);
+
68 assert(math::is_prime(-7) == false);
+
69 assert(math::is_prime(19) == true);
+
70 assert(math::is_prime(50) == false);
+
71 assert(math::is_prime(115249) == true);
+
72
+
73 std::cout << "All tests have successfully passed!" << std::endl;
+
74}
+ +
std::endl
T endl(T... args)
+
math::is_prime
bool is_prime(int64_t num)
Function to check if the given number is prime or not.
Definition check_prime.cpp:30
+
+Here is the call graph for this function:
+
+
diff --git a/db/d93/check__prime_8cpp.js b/db/d93/check__prime_8cpp.js index 37d788d16..548889b3c 100644 --- a/db/d93/check__prime_8cpp.js +++ b/db/d93/check__prime_8cpp.js @@ -1,5 +1,6 @@ var check__prime_8cpp = [ - [ "is_prime", "db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532", null ], - [ "main", "db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] + [ "is_prime", "db/d93/check__prime_8cpp.html#abd8f794b2229b42876169ff841b6e444", null ], + [ "main", "db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "tests", "db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] ]; \ No newline at end of file diff --git a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map new file mode 100644 index 000000000..ca8d00bf2 --- /dev/null +++ b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 new file mode 100644 index 000000000..1e06485d5 --- /dev/null +++ b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 @@ -0,0 +1 @@ +9c5a2a03b8386cbd80dfb8b3134f2e02 \ No newline at end of file diff --git a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg new file mode 100644 index 000000000..968651279 --- /dev/null +++ b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + + + + + + +tests + + +Node1 + + +tests + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +math::is_prime + + + + + +Node1->Node3 + + + + + + + + + + + + + diff --git a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg new file mode 100644 index 000000000..c1178f1f1 --- /dev/null +++ b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg @@ -0,0 +1,57 @@ + + + + + + +tests + + +Node1 + + +tests + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +math::is_prime + + + + + +Node1->Node3 + + + + + + + + diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 164323fd3..babca0ba0 100644 --- a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,7 +1,9 @@ - - - - - + + + + + + + diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 01c938ff2..830cc3234 100644 --- a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -045fac8f0573f6c028be62240e1f7e2f \ No newline at end of file +ecc3356383182ba366fc14e7f9dd3ffe \ No newline at end of file diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index d5f9c8578..a10e972f3 100644 --- a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - +