mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-13 17:50:45 +08:00
feat: update CMake version to 3.26.4 (#2486)
* 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:
@@ -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.
|
||||
*
|
||||
|
||||
Reference in New Issue
Block a user