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

Documentation for ef209dfab3

Browse Source
This commit is contained in:
realstealthninja
2024-09-04 23:46:13 +00:00
parent 2fb0f6c4d8
commit 0ee61d53b7
58 changed files with 2369 additions and 167 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
files.html
View File

@@ -403,15 +403,16 @@ N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bis
<tr id="row_22_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/da8/pigeonhole__sort_8cpp.html" target="_self">pigeonhole_sort.cpp</a></td><td class="desc">Implementation of [Pigeonhole Sort algorithm] (<a href="https://en.wikipedia.org/wiki/Pigeonhole_sort">https://en.wikipedia.org/wiki/Pigeonhole_sort</a>) </td></tr>
<tr id="row_22_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d21/quick__sort_8cpp.html" target="_self">quick_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++ </td></tr>
<tr id="row_22_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d4c/quick__sort__3_8cpp.html" target="_self">quick_sort_3.cpp</a></td><td class="desc">Implementation Details </td></tr>
<tr id="row_22_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d61/radix__sort2_8cpp.html" target="_self">radix_sort2.cpp</a></td><td class="desc">Algorithm of <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> </td></tr>
<tr id="row_22_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/daa/random__pivot__quick__sort_8cpp.html" target="_self">random_pivot_quick_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> algorithm </td></tr>
<tr id="row_22_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/df9/recursive__bubble__sort_8cpp.html" target="_self">recursive_bubble_sort.cpp</a></td><td class="desc">This is an implementation of a recursive version of the <a href="https://www.geeksforgeeks.org/recursive-bubble-sort/" target="_blank">Bubble sort algorithm</a> </td></tr>
<tr id="row_22_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9f/selection__sort__recursive_8cpp.html" target="_self">selection_sort_recursive.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion </td></tr>
<tr id="row_22_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d7a/shell__sort2_8cpp.html" target="_self">shell_sort2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm </td></tr>
<tr id="row_22_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d4f/stooge__sort_8cpp.html" target="_self">stooge_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Stooge_sort" target="_blank">Stooge sort implementation</a> in C++ </td></tr>
<tr id="row_22_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dd9/strand__sort_8cpp.html" target="_self">strand_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
<tr id="row_22_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d3f/wave__sort_8cpp.html" target="_self">wave_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm </td></tr>
<tr id="row_22_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dcc/wiggle__sort_8cpp.html" target="_self">wiggle_sort.cpp</a></td><td class="desc">[Wiggle Sort Algorithm] (<a href="https://leetcode.com/problems/wiggle-sort-ii/">https://leetcode.com/problems/wiggle-sort-ii/</a>) Implementation </td></tr>
<tr id="row_22_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d22/quick__sort__iterative_8cpp.html" target="_self">quick_sort_iterative.cpp</a></td><td class="desc">Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case </td></tr>
<tr id="row_22_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d61/radix__sort2_8cpp.html" target="_self">radix_sort2.cpp</a></td><td class="desc">Algorithm of <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> </td></tr>
<tr id="row_22_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/daa/random__pivot__quick__sort_8cpp.html" target="_self">random_pivot_quick_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> algorithm </td></tr>
<tr id="row_22_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/df9/recursive__bubble__sort_8cpp.html" target="_self">recursive_bubble_sort.cpp</a></td><td class="desc">This is an implementation of a recursive version of the <a href="https://www.geeksforgeeks.org/recursive-bubble-sort/" target="_blank">Bubble sort algorithm</a> </td></tr>
<tr id="row_22_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9f/selection__sort__recursive_8cpp.html" target="_self">selection_sort_recursive.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion </td></tr>
<tr id="row_22_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d7a/shell__sort2_8cpp.html" target="_self">shell_sort2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm </td></tr>
<tr id="row_22_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d4f/stooge__sort_8cpp.html" target="_self">stooge_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Stooge_sort" target="_blank">Stooge sort implementation</a> in C++ </td></tr>
<tr id="row_22_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dd9/strand__sort_8cpp.html" target="_self">strand_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
<tr id="row_22_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d3f/wave__sort_8cpp.html" target="_self">wave_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm </td></tr>
<tr id="row_22_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dcc/wiggle__sort_8cpp.html" target="_self">wiggle_sort.cpp</a></td><td class="desc">[Wiggle Sort Algorithm] (<a href="https://leetcode.com/problems/wiggle-sort-ii/">https://leetcode.com/problems/wiggle-sort-ii/</a>) Implementation </td></tr>
<tr id="row_23_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_23_" class="arrow" onclick="dynsection.toggleFolder('23_')">&#9658;</span><span id="img_23_" class="iconfclosed" onclick="dynsection.toggleFolder('23_')">&#160;</span><a class="el" href="dir_73a3cc5065b223eb41b02873c0e19f0e.html" target="_self">strings</a></td><td class="desc"></td></tr>
<tr id="row_23_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/db2/boyer__moore_8cpp.html" target="_self">boyer_moore.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> 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 </td></tr>
<tr id="row_23_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html" target="_self">brute_force_string_searching.cpp</a></td><td class="desc">String pattern search - brute force </td></tr>