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

Documentation for 0931d530ae

Browse Source
This commit is contained in:
github-actions
2023-01-22 19:44:10 +00:00
parent a448f64699
commit b48f6e8671
2457 changed files with 9513 additions and 8691 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
d5/d45/sublist__search_8cpp.html
View File

@@ -3,7 +3,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.9.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: search/sublist_search.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -138,23 +138,23 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ad1028bc215281d62e344af99da57fab2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *start)</td></tr>
<tr class="memdesc:ad1028bc215281d62e344af99da57fab2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple function to print the linked list. <a href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">More...</a><br /></td></tr>
<tr class="memdesc:ad1028bc215281d62e344af99da57fab2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple function to print the linked list. <br /></td></tr>
<tr class="separator:ad1028bc215281d62e344af99da57fab2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="mdescLeft">&#160;</td><td class="mdescRight">Give a vector of data, it adds each element of vector in the linked list and return the address of head pointer. <a href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">More...</a><br /></td></tr>
<tr class="memdesc:a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="mdescLeft">&#160;</td><td class="mdescRight">Give a vector of data, it adds each element of vector in the linked list and return the address of head pointer. <br /></td></tr>
<tr class="separator:a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4faee403e2758aaab682ed6622ae218c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *sublist, <a class="el" href="../../db/d8b/struct_node.html">Node</a> *mainList)</td></tr>
<tr class="memdesc:a4faee403e2758aaab682ed6622ae218c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main searching function. <a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">More...</a><br /></td></tr>
<tr class="memdesc:a4faee403e2758aaab682ed6622ae218c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main searching function. <br /></td></tr>
<tr class="separator:a4faee403e2758aaab682ed6622ae218c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <a href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">More...</a><br /></td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> </p>
<div class="textblock"><p>Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> </p>
<h3><a class="anchor" id="autotoc_md107"></a>
Algorithm</h3>
<ul>
@@ -205,10 +205,10 @@ Working</h3>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p >&lt; Main list in which sublist is to be searched</p>
<p >&lt; Sublist to be searched</p>
<p >&lt; Main list in which sublist is to be searched</p>
<p >&lt; boolean to check if the sublist exists or not</p>
<p>&lt; Main list in which sublist is to be searched</p>
<p>&lt; Sublist to be searched</p>
<p>&lt; Main list in which sublist is to be searched</p>
<p>&lt; boolean to check if the sublist exists or not</p>
<div class="fragment"><div class="line"><span class="lineno"> 339</span> {</div>
<div class="line"><span class="lineno"> 340</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 341</span> </div>
@@ -283,7 +283,7 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Node* A head pointer to the linked list. </dd></dl>
<p >This is used in test cases for rapidly creating linked list with 100+ elements, instead of hard-coding 100 elements in test cases.</p>
<p>This is used in test cases for rapidly creating linked list with 100+ elements, instead of hard-coding 100 elements in test cases.</p>
<div class="fragment"><div class="line"><span class="lineno"> 73</span> {<span class="comment"></span></div>
<div class="line"><span class="lineno"> 74</span><span class="comment"> /// This is used in test cases for rapidly creating linked list with 100+</span></div>
<div class="line"><span class="lineno"> 75</span><span class="comment"> /// elements, instead of hard-coding 100 elements in test cases.</span></div>
@@ -392,13 +392,13 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>true if the sublist is found </dd>
<dd>
false if the sublist is NOT found </dd></dl>
<p >Initialize target pointer to the head node of sublist.</p>
<p >Initialize main pointer to the current node of main list.</p>
<p >If the data of target node and main node is equal then move to the next node of both lists.</p>
<p >Is target pointer becomes null that means the target list is been traversed without returning false. Which means the sublist has been found and return ture.</p>
<p >set the target pointer again to stating point of target list.</p>
<p >set the main pointer to the next element of the main list and repeat the algo.</p>
<p >If the main list is exhausted, means sublist does not found, return false</p>
<p>Initialize target pointer to the head node of sublist.</p>
<p>Initialize main pointer to the current node of main list.</p>
<p>If the data of target node and main node is equal then move to the next node of both lists.</p>
<p>Is target pointer becomes null that means the target list is been traversed without returning false. Which means the sublist has been found and return ture.</p>
<p>set the target pointer again to stating point of target list.</p>
<p>set the main pointer to the next element of the main list and repeat the algo.</p>
<p>If the main list is exhausted, means sublist does not found, return false</p>
<div class="fragment"><div class="line"><span class="lineno"> 100</span> {</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">if</span> (sublist == <span class="keyword">nullptr</span> || mainList == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 102</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -500,7 +500,7 @@ Here is the call graph for this function:</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="../../d5/d45/sublist__search_8cpp.html">sublist_search.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.9.5 </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.9.6 </li>
</ul>
</div>
</body>