OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: update CMake version to 3.26.4 (#2486)

Browse Source 
* update cmake version

* clang-format and clang-tidy fixes for 402c5627

---------

Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com>
This commit is contained in:
Sujal Gupta 2023-06-17 03:38:45 +05:30 committed by GitHub
parent d7a9869dce
commit 2d492834b1
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
4 changed files with 42 additions and 39 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
CMakeLists.txt
View File

@ -1,4 +1,4 @@
cmake_minimum_required(VERSION 3.9)
cmake_minimum_required(VERSION 3.26.4)
project(Algorithms_in_C++
LANGUAGES CXX
VERSION 1.0.0

4
math/check_factorial.cpp
View File

@ -1,7 +1,7 @@
/**
* @file
* @brief A simple program to check if the given number is a [factorial](https://en.wikipedia.org/wiki/Factorial) of some
* number or not.
* @brief A simple program to check if the given number is a
* [factorial](https://en.wikipedia.org/wiki/Factorial) of some number or not.
*
* @details A factorial number is the sum of k! where any value of k is a
* positive integer. https://www.mathsisfun.com/numbers/factorial.html

19
math/check_prime.cpp
View File

@ -1,13 +1,14 @@
/**
* @file
* @brief
* A simple program to check if the given number is [Prime](https://en.wikipedia.org/wiki/Primality_test) or not.
* A simple program to check if the given number is
* [Prime](https://en.wikipedia.org/wiki/Primality_test) or not.
* @details
* 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:
* 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](https://github.com/omkarlanghe)
* @author [ewd00010](https://github.com/ewd00010)
@ -21,13 +22,13 @@
* @namespace
*/
namespace math {
/**
/**
* @brief Function to check if the given number is prime or not.
* @param num number to be checked.
* @return true if number is a prime
* @return false if number is not a prime.
*/
bool is_prime(int64_t num) {
bool is_prime(int64_t num) {
/*!
* Reduce all possibilities of a number which cannot be prime with the first
* 3 if, else if conditionals. Example: Since no even number, except 2 can
@ -51,7 +52,7 @@ namespace math {
}
}
return true;
}
}
} // namespace math
/**

8
strings/boyer_moore.cpp
View File

@ -1,9 +1,11 @@
/**
* @file
* @brief
* The [Boyer–Moore](https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm) algorithm searches for occurrences of pattern P in text T by
* performing explicit character comparisons at different alignments. Instead of
* a brute-force search of all alignments (of which there are n - m + 1),
* The
* [Boyer–Moore](https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm)
* algorithm searches for occurrences of pattern P in text T by performing
* explicit character comparisons at different alignments. Instead of a
* brute-force search of all alignments (of which there are n - m + 1),
* Boyer–Moore uses information gained by preprocessing P to skip as many
* alignments as possible.
*