backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-11-01 13:25:15 +08:00
Code Issues Projects Releases Wiki Activity

Revert "feat: update CMake version to 3.26.4 (#2486)"

Browse Source 
This reverts commit 2d492834b1.
This commit is contained in:
David Leal
2023-06-20 15:47:41 -06:00
committed by GitHub
parent 2d492834b1
commit d40bf6430c
4 changed files with 39 additions and 42 deletions
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.26.4) cmake_minimum_required(VERSION 3.9)
project(Algorithms_in_C++ project(Algorithms_in_C++
LANGUAGES CXX LANGUAGES CXX
VERSION 1.0.0 VERSION 1.0.0

4
math/check_factorial.cpp
View File

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

13
math/check_prime.cpp
View File

@@ -1,14 +1,13 @@
/** /**
* @file * @file
* @brief * @brief
* A simple program to check if the given number is * A simple program to check if the given number is [Prime](https://en.wikipedia.org/wiki/Primality_test) or not.
* [Prime](https://en.wikipedia.org/wiki/Primality_test) or not.
* @details * @details
* A prime number is any number that can be divided only by itself and 1. It * A prime number is any number that can be divided only by itself and 1. It must
* must be positive and a whole number, therefore any prime number is part of * be positive and a whole number, therefore any prime number is part of the
* the set of natural numbers. The majority of prime numbers are even numbers, * set of natural numbers. The majority of prime numbers are even numbers, with
* with the exception of 2. This algorithm finds prime numbers using this * the exception of 2. This algorithm finds prime numbers using this information.
* information. additional ways to solve the prime check problem: * additional ways to solve the prime check problem:
* https://cp-algorithms.com/algebra/primality_tests.html#practice-problems * https://cp-algorithms.com/algebra/primality_tests.html#practice-problems
* @author [Omkar Langhe](https://github.com/omkarlanghe) * @author [Omkar Langhe](https://github.com/omkarlanghe)
* @author [ewd00010](https://github.com/ewd00010) * @author [ewd00010](https://github.com/ewd00010)

8
strings/boyer_moore.cpp
View File

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