backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 20:31:43 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 842c4ab5dd

Browse Source
This commit is contained in:
github-actions
2023-04-21 16:16:37 +00:00
parent 32e090479d
commit 64c9693255
46 changed files with 332 additions and 256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d8/df0/queue__using__array_8cpp.html
View File

@@ -147,7 +147,7 @@ Variables</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of Linear [<a class="el" href="../../dc/db5/struct_queue.html">Queue</a> using array] (<a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">https://www.geeksforgeeks.org/array-implementation-of-queue-simple/</a>). </p>
<p>The Linear <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> is a data structure used for holding a sequence of values, which can be added to the end line (enqueue), removed from head of line (dequeue) and displayed. </p>
<h3><a class="anchor" id="autotoc_md42"></a>
<h3><a class="anchor" id="autotoc_md43"></a>
Algorithm</h3>
<p>Values can be added by increasing the <code>rear</code> variable by 1 (which points to the end of the array), then assigning new value to <code>rear</code>'s element of the array.</p>
<p>Values can be removed by increasing the <code>front</code> variable by 1 (which points to the first of the array), so it cannot reached any more.</p>