backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +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

18
d3/dce/linkedlist__implentation__usingarray_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++: data_structures/linkedlist_implentation_usingarray.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');
@@ -151,8 +151,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
<tr class="separator:ab84c7d9bed2aa1ade1fd61fbf5c2e07e"><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 >Linked list implementation using Arrays. </p>
<p >The difference between the pointer implementation of linked list and array implementation of linked list:</p><ol type="1">
<div class="textblock"><p>Linked list implementation using Arrays. </p>
<p>The difference between the pointer implementation of linked list and array implementation of linked list:</p><ol type="1">
<li>The NULL is represented by -1;</li>
<li>Limited size. (in the following case it is 100 nodes at max). But we can reuse the nodes that are to be deleted by again linking it bacj to the list. </li>
</ol>
@@ -200,7 +200,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
</tr>
</table>
</div><div class="memdoc">
<p >This function when called will delete the node with the index presented as an argument, and will put back that node into the array. </p>
<p>This function when called will delete the node with the index presented as an argument, and will put back that node into the array. </p>
<div class="fragment"><div class="line"><span class="lineno"> 42</span> {</div>
<div class="line"><span class="lineno"> 43</span> <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[nodeToBeDeleted].next = avail;</div>
<div class="line"><span class="lineno"> 44</span> avail = nodeToBeDeleted;</div>
@@ -222,7 +222,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
</tr>
</table>
</div><div class="memdoc">
<p >This will return the index of the first free node present in the avail list </p>
<p>This will return the index of the first free node present in the avail list </p>
<div class="fragment"><div class="line"><span class="lineno"> 32</span> {</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordtype">int</span> NodeIndexToBeReturned = avail;</div>
<div class="line"><span class="lineno"> 34</span> avail = <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[avail].next;</div>
@@ -269,7 +269,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
</tr>
</table>
</div><div class="memdoc">
<p >The function will insert the given data into the front of the linked list. </p>
<p>The function will insert the given data into the front of the linked list. </p>
<div class="fragment"><div class="line"><span class="lineno"> 50</span> {</div>
<div class="line"><span class="lineno"> 51</span> <span class="keywordtype">int</span> newNode = <a class="code hl_function" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">getnode</a>();</div>
<div class="line"><span class="lineno"> 52</span> <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[newNode].data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
@@ -331,7 +331,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Main function </p>
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 79</span> {</div>
<div class="line"><span class="lineno"> 80</span> initialise_list();</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordtype">int</span> x, y, z;</div>
@@ -385,7 +385,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_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html">linkedlist_implentation_usingarray.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>