backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-03 08:52:03 +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
d7/d00/list__array_8cpp.html
View File

@@ -144,7 +144,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> </p>
<p>The <a class="el" href="../../d9/d27/namespacelist__array.html" title="Functions for Dynamic Array algorithm.">list_array</a> is the implementation of list represented using array. We can perform basic CRUD operations as well as other operations like sorting etc.</p>
<h3><a class="anchor" id="autotoc_md41"></a>
<h3><a class="anchor" id="autotoc_md42"></a>
Algorithm</h3>
<p>It implements various method like insert, sort, search etc. efficiently. You can select the operation and methods will do the rest work for you. You can insert element, sort them in order, search efficiently, delete values and print the list. </p>
</div><h2 class="groupheader">Function Documentation</h2>

2
d7/d73/abbreviation_8cpp.html
View File

@@ -147,7 +147,7 @@ Functions</h2></td></tr>
<li>Capitalize zero or more of <code>a</code>'s lowercase letters.</li>
<li>Delete all of the remaining lowercase letters in <code>a</code>.</li>
</ol>
<h3><a class="anchor" id="autotoc_md68"></a>
<h3><a class="anchor" id="autotoc_md69"></a>
Algorithm</h3>
<p>The idea is in the problem statement itself: iterate through characters of string <code>a</code> and <code>b</code> (for character indexes <code>i</code> and <code>j</code> respectively):</p><ol type="1">
<li>If <code>a[i]</code> and <code>b[j]</code> are equal, then move to next position</li>