Documentation for f1eddf4d65

This commit is contained in:
realstealthninja
2025-07-09 10:53:16 +00:00
parent e7edde96ab
commit b41207008f
2497 changed files with 31270 additions and 40283 deletions

View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: Backtracking</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -19,7 +19,6 @@
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
@@ -94,10 +87,9 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','../../'); initResizable(true); });
/* @license-end */
$(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
@@ -121,7 +113,7 @@ $(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','../../'); initResi
</div>
<div><div class="header">
<div class="headertitle"><div class="title">Backtracking</div></div>
<div class="headertitle"><div class="title">Backtracking </div></div>
</div><!--header-->
<div class="contents">
<div class="textblock"><p><a class="anchor" id="autotoc_md45"></a></p>
@@ -140,7 +132,7 @@ $(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','../../'); initResi
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/backtracking/sudoku_solver.cpp" target="_blank">Sudoku Solver</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/backtracking/wildcard_matching.cpp" target="_blank">Wildcard Matching</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md46"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md46"></a>
Bit Manipulation</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/bit_manipulation/count_bits_flip.cpp" target="_blank">Count Bits Flip</a></li>
@@ -154,7 +146,7 @@ Bit Manipulation</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/bit_manipulation/set_kth_bit.cpp" target="_blank">Set Kth Bit</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/bit_manipulation/travelling_salesman_using_bit_manipulation.cpp" target="_blank">Travelling Salesman Using Bit Manipulation</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md47"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md47"></a>
Ciphers</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/ciphers/a1z26_cipher.cpp" target="_blank">A1Z26 Cipher</a></li>
@@ -169,13 +161,13 @@ Ciphers</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/ciphers/vigenere_cipher.cpp" target="_blank">Vigenere Cipher</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/ciphers/xor_cipher.cpp" target="_blank">Xor Cipher</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md48"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md48"></a>
Cpu Scheduling Algorithms</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/cpu_scheduling_algorithms/fcfs_scheduling.cpp" target="_blank">Fcfs Scheduling</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp" target="_blank">Non Preemptive Sjf Scheduling</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md49"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md49"></a>
Data Structures</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/data_structures/avltree.cpp" target="_blank">Avltree</a></li>
@@ -224,13 +216,13 @@ Data Structures</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/data_structures/trie_tree.cpp" target="_blank">Trie Tree</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/data_structures/trie_using_hashmap.cpp" target="_blank">Trie Using Hashmap</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md50"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md50"></a>
Divide And Conquer</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp" target="_blank">Karatsuba Algorithm For Fast Multiplication</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/divide_and_conquer/strassen_matrix_multiplication.cpp" target="_blank">Strassen Matrix Multiplication</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md51"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md51"></a>
Dynamic Programming</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/0_1_knapsack.cpp" target="_blank">0 1 Knapsack</a></li>
@@ -265,12 +257,12 @@ Dynamic Programming</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/unbounded_0_1_knapsack.cpp" target="_blank">Unbounded 0 1 Knapsack</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/word_break.cpp" target="_blank">Word Break</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md52"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md52"></a>
Games</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/games/memory_game.cpp" target="_blank">Memory Game</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md53"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md53"></a>
Geometry</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/geometry/graham_scan_algorithm.cpp" target="_blank">Graham Scan Algorithm</a></li>
@@ -278,7 +270,7 @@ Geometry</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/geometry/jarvis_algorithm.cpp" target="_blank">Jarvis Algorithm</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/geometry/line_segment_intersection.cpp" target="_blank">Line Segment Intersection</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md54"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md54"></a>
Graph</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/graph/bidirectional_dijkstra.cpp" target="_blank">Bidirectional Dijkstra</a></li>
@@ -303,12 +295,12 @@ Graph</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/graph/topological_sort_by_kahns_algo.cpp" target="_blank">Topological Sort By Kahns Algo</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/graph/travelling_salesman_problem.cpp" target="_blank">Travelling Salesman Problem</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md55"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md55"></a>
Graphics</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/graphics/spirograph.cpp" target="_blank">Spirograph</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md56"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md56"></a>
Greedy Algorithms</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/binary_addition.cpp" target="_blank">Binary Addition</a></li>
@@ -322,7 +314,7 @@ Greedy Algorithms</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/kruskals_minimum_spanning_tree.cpp" target="_blank">Kruskals Minimum Spanning Tree</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/prims_minimum_spanning_tree.cpp" target="_blank">Prims Minimum Spanning Tree</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md57"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md57"></a>
Hashing</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/hashing/chaining.cpp" target="_blank">Chaining</a></li>
@@ -333,7 +325,7 @@ Hashing</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/hashing/sha1.cpp" target="_blank">Sha1</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/hashing/sha256.cpp" target="_blank">Sha256</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md58"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md58"></a>
Machine Learning</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/machine_learning/a_star_search.cpp" target="_blank">A Star Search</a></li>
@@ -345,7 +337,7 @@ Machine Learning</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/machine_learning/ordinary_least_squares_regressor.cpp" target="_blank">Ordinary Least Squares Regressor</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/machine_learning/vector_ops.hpp" target="_blank">Vector Ops</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md59"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md59"></a>
Math</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/aliquot_sum.cpp" target="_blank">Aliquot Sum</a></li>
@@ -409,7 +401,7 @@ Math</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/vector_cross_product.cpp" target="_blank">Vector Cross Product</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/volume.cpp" target="_blank">Volume</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md60"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md60"></a>
Numerical Methods</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/numerical_methods/babylonian_method.cpp" target="_blank">Babylonian Method</a></li>
@@ -436,7 +428,7 @@ Numerical Methods</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/numerical_methods/rungekutta.cpp" target="_blank">Rungekutta</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/numerical_methods/successive_approximation.cpp" target="_blank">Successive Approximation</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md61"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md61"></a>
Operations On Datastructures</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/operations_on_datastructures/array_left_rotation.cpp" target="_blank">Array Left Rotation</a></li>
@@ -452,7 +444,7 @@ Operations On Datastructures</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/operations_on_datastructures/trie_multiple_search.cpp" target="_blank">Trie Multiple Search</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/operations_on_datastructures/union_of_two_arrays.cpp" target="_blank">Union Of Two Arrays</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md62"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md62"></a>
Others</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/buzz_number.cpp" target="_blank">Buzz Number</a></li>
@@ -483,12 +475,12 @@ Others</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/tower_of_hanoi.cpp" target="_blank">Tower Of Hanoi</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/vector_important_functions.cpp" target="_blank">Vector Important Functions</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md63"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md63"></a>
Physics</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/physics/ground_to_ground_projectile_motion.cpp" target="_blank">Ground To Ground Projectile Motion</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md64"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md64"></a>
Probability</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/probability/addition_rule.cpp" target="_blank">Addition Rule</a></li>
@@ -499,7 +491,7 @@ Probability</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/probability/poisson_dist.cpp" target="_blank">Poisson Dist</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/probability/windowed_median.cpp" target="_blank">Windowed Median</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md65"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md65"></a>
Range Queries</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/range_queries/fenwick_tree.cpp" target="_blank">Fenwick Tree</a></li>
@@ -510,7 +502,7 @@ Range Queries</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/range_queries/segtree.cpp" target="_blank">Segtree</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/range_queries/sparse_table_range_queries.cpp" target="_blank">Sparse Table Range Queries</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md66"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md66"></a>
Search</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/binary_search.cpp" target="_blank">Binary Search</a></li>
@@ -530,7 +522,7 @@ Search</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/ternary_search.cpp" target="_blank">Ternary Search</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/text_search.cpp" target="_blank">Text Search</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md67"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md67"></a>
Sorting</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/sorting/bead_sort.cpp" target="_blank">Bead Sort</a></li>
@@ -577,7 +569,7 @@ Sorting</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/sorting/wave_sort.cpp" target="_blank">Wave Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/sorting/wiggle_sort.cpp" target="_blank">Wiggle Sort</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md68"></a>
<h1 class="doxsection"><a class="anchor" id="autotoc_md68"></a>
Strings</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/strings/boyer_moore.cpp" target="_blank">Boyer Moore</a></li>
@@ -592,10 +584,18 @@ Strings</h1>
</div></div><!-- contents -->
</div><!-- PageDoc -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
</ul>
</div>
</body>