backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-11 14:36:12 +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

19
db/dc4/floyd__cycle__detection__algo_8cpp.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 File Reference</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');
@@ -153,7 +153,7 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a81ffc7a2c6bf530c8a496864e7a3ad88" id="r_a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a81ffc7a2c6bf530c8a496864e7a3ad88" id="r_a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
<tr class="memitem:a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="memTemplItemLeft" align="right" valign="top">int32_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a> (const std::vector&lt; T &gt; &amp;in_arr, const uint32_t &amp;n)</td></tr>
<tr class="memdesc:a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements search algorithm. <br /></td></tr>
<tr class="separator:a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -176,7 +176,7 @@ Functions</h2></td></tr>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
template&lt;typename T&gt; </div>
<table class="memname">
<tr>
<td class="memname">int32_t search::cycle_detection::duplicateNumber </td>
@@ -276,7 +276,7 @@ template&lt;typename T &gt; </div>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -290,7 +290,7 @@ template&lt;typename T &gt; </div>
<div class="line"><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"><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"><span class="lineno"> 68</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
<div class="line"><span class="lineno"> 69</span> assert(search::cycle_detection::duplicateNumber(array1, array1.size()) ==</div>
<div class="line"><span class="lineno"> 69</span> assert(<a class="code hl_function" href="#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a>(array1, array1.size()) ==</div>
<div class="line"><span class="lineno"> 70</span> 4); <span class="comment">// here the duplicate number is 4</span></div>
<div class="line"><span class="lineno"> 71</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 72</span> </div>
@@ -298,7 +298,7 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 74</span> <span class="comment">// [1, 2, 3, 4, 2] return 2</span></div>
<div class="line"><span class="lineno"> 75</span> std::vector&lt;uint32_t&gt; array2 = {1, 2, 3, 4, 2};</div>
<div class="line"><span class="lineno"> 76</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
<div class="line"><span class="lineno"> 77</span> assert(search::cycle_detection::duplicateNumber(array2, array2.size()) ==</div>
<div class="line"><span class="lineno"> 77</span> assert(<a class="code hl_function" href="#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a>(array2, array2.size()) ==</div>
<div class="line"><span class="lineno"> 78</span> 2); <span class="comment">// here the duplicate number is 2</span></div>
<div class="line"><span class="lineno"> 79</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 80</span> </div>
@@ -306,11 +306,12 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 82</span> <span class="comment">// [] return -1</span></div>
<div class="line"><span class="lineno"> 83</span> std::vector&lt;uint32_t&gt; array3 = {};</div>
<div class="line"><span class="lineno"> 84</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
<div class="line"><span class="lineno"> 85</span> assert(search::cycle_detection::duplicateNumber(array3, array3.size()) ==</div>
<div class="line"><span class="lineno"> 85</span> assert(<a class="code hl_function" href="#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a>(array3, array3.size()) ==</div>
<div class="line"><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"><span class="lineno"> 87</span> <span class="comment">// this case</span></div>
<div class="line"><span class="lineno"> 88</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 89</span>}</div>
<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_a81ffc7a2c6bf530c8a496864e7a3ad88"><div class="ttname"><a href="#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="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html#l00037">floyd_cycle_detection_algo.cpp:37</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -320,7 +321,7 @@ template&lt;typename T &gt; </div>
<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>