backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-24 18:43:17 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 582cdc7cc4

Browse Source
This commit is contained in:
github-actions
2022-12-21 16:49:13 +00:00
parent 8634a89f05
commit 7b0b042940
3228 changed files with 8908 additions and 8871 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
d5/d45/sublist__search_8cpp.html
View File

@@ -155,14 +155,14 @@ Functions</h2></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>
<h3><a class="anchor" id="autotoc_md106"></a>
<h3><a class="anchor" id="autotoc_md107"></a>
Algorithm</h3>
<ul>
<li>Sublist search is used to detect a presence of one list in another list.</li>
<li>Suppose we have a single-node list (let's say the first list), and we want to ensure that the list is present in another list (let's say the second list), then we can perform the sublist search to find it.</li>
<li>For instance, the first list contains these elements: 23 -&gt; 30 -&gt; 41, and the second list contains these elements: 10 -&gt; 15 -&gt; 23 -&gt; 30 -&gt; 41 -&gt; 49. At a glance, we see that the first list presents in the second list.</li>
</ul>
<h3><a class="anchor" id="autotoc_md107"></a>
<h3><a class="anchor" id="autotoc_md108"></a>
Working</h3>
<ul>
<li>The sublist search algorithm works by comparing the first element of the first list with the first element of the second list.</li>