backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c26eea874d

Browse Source
This commit is contained in:
realstealthninja
2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
db/dc4/floyd__cycle__detection__algo_8cpp_source.html
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.12.0"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: search/floyd_cycle_detection_algo.cpp Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -124,7 +124,8 @@ $(function(){initNavTree('db/dc4/floyd__cycle__detection__algo_8cpp_source.html'
<div class="headertitle"><div class="title">floyd_cycle_detection_algo.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
<a href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
@@ -156,14 +157,14 @@ $(function(){initNavTree('db/dc4/floyd__cycle__detection__algo_8cpp_source.html'
</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span>} <span class="comment">// namespace cycle_detection</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span>} <span class="comment">// namespace search</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span></div>
<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 64</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// 1st test</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// [3, 4, 8, 5, 9, 1, 2, 6, 7, 4] return 4</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> std::vector&lt;uint32_t&gt; array1 = {3, 4, 8, 5, 9, 1, 2, 6, 7, 4};</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> assert(search::cycle_detection::duplicateNumber(array1, array1.size()) ==</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> assert(<a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a>(array1, array1.size()) ==</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> 4); <span class="comment">// here the duplicate number is 4</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
@@ -171,7 +172,7 @@ $(function(){initNavTree('db/dc4/floyd__cycle__detection__algo_8cpp_source.html'
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// [1, 2, 3, 4, 2] return 2</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> std::vector&lt;uint32_t&gt; array2 = {1, 2, 3, 4, 2};</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> assert(search::cycle_detection::duplicateNumber(array2, array2.size()) ==</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> assert(<a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a>(array2, array2.size()) ==</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> 2); <span class="comment">// here the duplicate number is 2</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
@@ -179,13 +180,13 @@ $(function(){initNavTree('db/dc4/floyd__cycle__detection__algo_8cpp_source.html'
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// [] return -1</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> std::vector&lt;uint32_t&gt; array3 = {};</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> assert(search::cycle_detection::duplicateNumber(array3, array3.size()) ==</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> assert(<a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a>(array3, array3.size()) ==</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> -1); <span class="comment">// since the input array is empty no duplicate number exists in</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// this case</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span>}</div>
</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span></div>
<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 95</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
@@ -195,7 +196,7 @@ $(function(){initNavTree('db/dc4/floyd__cycle__detection__algo_8cpp_source.html'
<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_a81ffc7a2c6bf530c8a496864e7a3ad88"><div class="ttname"><a href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a></div><div class="ttdeci">int32_t duplicateNumber(const std::vector&lt; T &gt; &amp;in_arr, const uint32_t &amp;n)</div><div class="ttdoc">The main function implements search algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">floyd_cycle_detection_algo.cpp:37</a></div></div>
<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">floyd_cycle_detection_algo.cpp:64</a></div></div>
<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00095">floyd_cycle_detection_algo.cpp:95</a></div></div>
<div class="ttc" id="anamespacecycle__detection_html"><div class="ttname"><a href="../../da/d82/namespacecycle__detection.html">cycle_detection</a></div><div class="ttdoc">Functions for the Floyd's Cycle Detection algorithm.</div></div>
<div class="ttc" id="anamespacecycle__detection_html"><div class="ttname"><a href="../../da/d82/namespacecycle__detection.html">cycle_detection</a></div><div class="ttdoc">Functions for the Floyd&#39;s Cycle Detection algorithm.</div></div>
<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
@@ -203,7 +204,7 @@ $(function(){initNavTree('db/dc4/floyd__cycle__detection__algo_8cpp_source.html'
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html">floyd_cycle_detection_algo.cpp</a></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.12.0 </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.13.2 </li>
</ul>
</div>
</body>