mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-17 12:02:22 +08:00
Documentation for 53a6c16730
This commit is contained in:
github-actions
@@ -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.2"/>
|
||||
<meta name="generator" content="Doxygen 1.9.3"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: data_structures::list_array::list Struct Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
@@ -30,8 +30,8 @@ MathJax.Hub.Config({
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<tr id="projectrow">
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.2 -->
|
||||
<!-- Generated by Doxygen 1.9.3 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
|
||||
@@ -100,6 +100,12 @@ $(document).ready(function(){initNavTree('d5/dab/structdata__structures_1_1list_
|
||||
|
||||
<p>Structure of List with supporting methods.
|
||||
<a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#details">More...</a></p>
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for data_structures::list_array::list:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg" width="148" height="246"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
|
||||
Public Member Functions</h2></td></tr>
|
||||
@@ -196,25 +202,25 @@ bool </td><td class="memItemRight" valign="bottom"><b>isSorted</b> = false<
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index of element in the list if present else -1 </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> {</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// If both pointer cross each other means no element present in the list which is equal to the val</span></div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordflow">if</span> (last < first) {</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> }</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> uint64_t mid = (first + last) / 2;</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// check whether current mid pointer value is equal to element or not</span></div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">if</span> (dataArr[mid] == val)</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keywordflow">return</span> mid;</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// if current mid value is greater than element we have to search in first half</span></div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val < dataArr[mid])</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(dataArr, first, mid - 1, val));</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// if current mid value is greater than element we have to search in second half</span></div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val > dataArr[mid])</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(dataArr, mid + 1, last, val));</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> </div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << __func__ << <span class="stringliteral">":"</span> << __LINE__ << <span class="stringliteral">": Undefined condition\n"</span>;</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="comment">// If both pointer cross each other means no element present in the list which is equal to the val</span></div>
|
||||
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">if</span> (last < first) {</div>
|
||||
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><span class="lineno"> 49</span> }</div>
|
||||
<div class="line"><span class="lineno"> 50</span> uint64_t mid = (first + last) / 2;</div>
|
||||
<div class="line"><span class="lineno"> 51</span> <span class="comment">// check whether current mid pointer value is equal to element or not</span></div>
|
||||
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">if</span> (dataArr[mid] == val)</div>
|
||||
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">return</span> mid;</div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="comment">// if current mid value is greater than element we have to search in first half</span></div>
|
||||
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val < dataArr[mid])</div>
|
||||
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(dataArr, first, mid - 1, val));</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="comment">// if current mid value is greater than element we have to search in second half</span></div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val > dataArr[mid])</div>
|
||||
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(dataArr, mid + 1, last, val));</div>
|
||||
<div class="line"><span class="lineno"> 60</span> </div>
|
||||
<div class="line"><span class="lineno"> 61</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << __func__ << <span class="stringliteral">":"</span> << __LINE__ << <span class="stringliteral">": Undefined condition\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><span class="lineno"> 63</span> }</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
|
||||
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a3b4abfffc730e07fcbd5844e09add8cd"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array< uint64_t, 50 > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)</div><div class="ttdoc">Search an element in the list using binarySearch.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:44</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
@@ -258,39 +264,39 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> {</div>
|
||||
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// overflow check</span></div>
|
||||
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="keywordflow">if</span> (top == 49) {</div>
|
||||
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nOverflow"</span>;</div>
|
||||
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> }</div>
|
||||
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// if list is not sorted, insert at the last</span></div>
|
||||
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// otherwise place it to correct position</span></div>
|
||||
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordflow">if</span> (!isSorted) {</div>
|
||||
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> data[top] = val;</div>
|
||||
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> top++;</div>
|
||||
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> uint64_t pos = 0; <span class="comment">// Initialize the index variable</span></div>
|
||||
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// Going through each element and find correct position for element</span></div>
|
||||
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < top - 1; i++) {</div>
|
||||
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// check for the correct position</span></div>
|
||||
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordflow">if</span> (data[i] <= val && val <= data[i + 1]) {</div>
|
||||
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> pos = i + 1; <span class="comment">// assign correct pos to the index var</span></div>
|
||||
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">break</span>; <span class="comment">// to get out from the loop</span></div>
|
||||
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> }</div>
|
||||
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> }</div>
|
||||
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// if all elements are smaller than the element</span></div>
|
||||
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">if</span> (pos == 0) {</div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> pos = top - 1;</div>
|
||||
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> }</div>
|
||||
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// shift all element to make a room for new element</span></div>
|
||||
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordflow">for</span> (uint64_t i = top; i > pos; i--) {</div>
|
||||
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> data[i] = data[i - 1];</div>
|
||||
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> }</div>
|
||||
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> top++; <span class="comment">// Increment the value of top.</span></div>
|
||||
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> data[pos] = val; <span class="comment">// Assign the value to the correct index in the array</span></div>
|
||||
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> }</div>
|
||||
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 132</span> {</div>
|
||||
<div class="line"><span class="lineno"> 133</span> <span class="comment">// overflow check</span></div>
|
||||
<div class="line"><span class="lineno"> 134</span> <span class="keywordflow">if</span> (top == 49) {</div>
|
||||
<div class="line"><span class="lineno"> 135</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nOverflow"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 137</span> }</div>
|
||||
<div class="line"><span class="lineno"> 138</span> <span class="comment">// if list is not sorted, insert at the last</span></div>
|
||||
<div class="line"><span class="lineno"> 139</span> <span class="comment">// otherwise place it to correct position</span></div>
|
||||
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">if</span> (!isSorted) {</div>
|
||||
<div class="line"><span class="lineno"> 141</span> data[top] = val;</div>
|
||||
<div class="line"><span class="lineno"> 142</span> top++;</div>
|
||||
<div class="line"><span class="lineno"> 143</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 144</span> uint64_t pos = 0; <span class="comment">// Initialize the index variable</span></div>
|
||||
<div class="line"><span class="lineno"> 145</span> <span class="comment">// Going through each element and find correct position for element</span></div>
|
||||
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < top - 1; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 147</span> <span class="comment">// check for the correct position</span></div>
|
||||
<div class="line"><span class="lineno"> 148</span> <span class="keywordflow">if</span> (data[i] <= val && val <= data[i + 1]) {</div>
|
||||
<div class="line"><span class="lineno"> 149</span> pos = i + 1; <span class="comment">// assign correct pos to the index var</span></div>
|
||||
<div class="line"><span class="lineno"> 150</span> <span class="keywordflow">break</span>; <span class="comment">// to get out from the loop</span></div>
|
||||
<div class="line"><span class="lineno"> 151</span> }</div>
|
||||
<div class="line"><span class="lineno"> 152</span> }</div>
|
||||
<div class="line"><span class="lineno"> 153</span> <span class="comment">// if all elements are smaller than the element</span></div>
|
||||
<div class="line"><span class="lineno"> 154</span> <span class="keywordflow">if</span> (pos == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 155</span> pos = top - 1;</div>
|
||||
<div class="line"><span class="lineno"> 156</span> }</div>
|
||||
<div class="line"><span class="lineno"> 157</span> <span class="comment">// shift all element to make a room for new element</span></div>
|
||||
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">for</span> (uint64_t i = top; i > pos; i--) {</div>
|
||||
<div class="line"><span class="lineno"> 159</span> data[i] = data[i - 1];</div>
|
||||
<div class="line"><span class="lineno"> 160</span> }</div>
|
||||
<div class="line"><span class="lineno"> 161</span> top++; <span class="comment">// Increment the value of top.</span></div>
|
||||
<div class="line"><span class="lineno"> 162</span> data[pos] = val; <span class="comment">// Assign the value to the correct index in the array</span></div>
|
||||
<div class="line"><span class="lineno"> 163</span> }</div>
|
||||
<div class="line"><span class="lineno"> 164</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -337,16 +343,16 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index of element in the list if present else -1 </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> {</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// Going through each element in the list</span></div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">if</span> (dataArr[i] == val) {</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">return</span> i; <span class="comment">// element found at ith index</span></div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> }</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// element is not present in the list</span></div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 71</span> {</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="comment">// Going through each element in the list</span></div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">if</span> (dataArr[i] == val) {</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">return</span> i; <span class="comment">// element found at ith index</span></div>
|
||||
<div class="line"><span class="lineno"> 76</span> }</div>
|
||||
<div class="line"><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="comment">// element is not present in the list</span></div>
|
||||
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><span class="lineno"> 80</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -382,20 +388,20 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> {</div>
|
||||
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> uint64_t pos = <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(val); <span class="comment">// search the index of the value</span></div>
|
||||
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// if search returns -1, element does not present in the list</span></div>
|
||||
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">if</span> (pos == -1) {</div>
|
||||
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n Element does not present in the list "</span>;</div>
|
||||
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> }</div>
|
||||
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span> << data[pos] << <span class="stringliteral">" deleted"</span>; <span class="comment">// print the appropriate message</span></div>
|
||||
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// shift all the element 1 left to fill vacant space</span></div>
|
||||
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordflow">for</span> (uint64_t i = pos; i < top; i++) {</div>
|
||||
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i + 1];</div>
|
||||
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> }</div>
|
||||
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> top--; <span class="comment">// decrement the top variable to maintain last index</span></div>
|
||||
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 171</span> {</div>
|
||||
<div class="line"><span class="lineno"> 172</span> uint64_t pos = <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(val); <span class="comment">// search the index of the value</span></div>
|
||||
<div class="line"><span class="lineno"> 173</span> <span class="comment">// if search returns -1, element does not present in the list</span></div>
|
||||
<div class="line"><span class="lineno"> 174</span> <span class="keywordflow">if</span> (pos == -1) {</div>
|
||||
<div class="line"><span class="lineno"> 175</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n Element does not present in the list "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 176</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 177</span> }</div>
|
||||
<div class="line"><span class="lineno"> 178</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span> << data[pos] << <span class="stringliteral">" deleted"</span>; <span class="comment">// print the appropriate message</span></div>
|
||||
<div class="line"><span class="lineno"> 179</span> <span class="comment">// shift all the element 1 left to fill vacant space</span></div>
|
||||
<div class="line"><span class="lineno"> 180</span> <span class="keywordflow">for</span> (uint64_t i = pos; i < top; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 181</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i + 1];</div>
|
||||
<div class="line"><span class="lineno"> 182</span> }</div>
|
||||
<div class="line"><span class="lineno"> 183</span> top--; <span class="comment">// decrement the top variable to maintain last index</span></div>
|
||||
<div class="line"><span class="lineno"> 184</span> }</div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:24</div></div>
|
||||
<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition:</b> binary_search.cpp:45</div></div>
|
||||
</div><!-- fragment -->
|
||||
@@ -424,24 +430,24 @@ Here is the call graph for this function:</div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<div class="fragment"><div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> {</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> uint64_t pos; <span class="comment">// pos variable to store index value of element.</span></div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// if list is sorted, binary search works efficiently else linear search is the only option</span></div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">if</span> (isSorted) {</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> pos = <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(data, 0, top - 1, val);</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> pos = <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53">LinearSearch</a>(data, val);</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> }</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// if index is equal to -1 means element does not present</span></div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// else print the index of that element</span></div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">if</span> (pos != -1) {</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nElement found at position : "</span> << pos;</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nElement not found"</span>;</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// return the index of element or -1.</span></div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">return</span> pos;</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 87</span> {</div>
|
||||
<div class="line"><span class="lineno"> 88</span> uint64_t pos; <span class="comment">// pos variable to store index value of element.</span></div>
|
||||
<div class="line"><span class="lineno"> 89</span> <span class="comment">// if list is sorted, binary search works efficiently else linear search is the only option</span></div>
|
||||
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">if</span> (isSorted) {</div>
|
||||
<div class="line"><span class="lineno"> 91</span> pos = <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(data, 0, top - 1, val);</div>
|
||||
<div class="line"><span class="lineno"> 92</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 93</span> pos = <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53">LinearSearch</a>(data, val);</div>
|
||||
<div class="line"><span class="lineno"> 94</span> }</div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="comment">// if index is equal to -1 means element does not present</span></div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="comment">// else print the index of that element</span></div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">if</span> (pos != -1) {</div>
|
||||
<div class="line"><span class="lineno"> 98</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nElement found at position : "</span> << pos;</div>
|
||||
<div class="line"><span class="lineno"> 99</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 100</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nElement not found"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 101</span> }</div>
|
||||
<div class="line"><span class="lineno"> 102</span> <span class="comment">// return the index of element or -1.</span></div>
|
||||
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">return</span> pos;</div>
|
||||
<div class="line"><span class="lineno"> 104</span> }</div>
|
||||
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ac91272e6c970299e51cccd6cbdfe9e53"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53">data_structures::list_array::list::LinearSearch</a></div><div class="ttdeci">uint64_t LinearSearch(const std::array< uint64_t, 50 > &dataArr, const uint64_t &val) const</div><div class="ttdoc">Search an element using linear search.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:71</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -471,13 +477,13 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Utility function to print array. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> {</div>
|
||||
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// Going through each element in the list</span></div>
|
||||
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="charliteral">'\n'</span>;</div>
|
||||
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << data[i] << <span class="stringliteral">" "</span>; <span class="comment">// print the element</span></div>
|
||||
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> }</div>
|
||||
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 190</span> {</div>
|
||||
<div class="line"><span class="lineno"> 191</span> <span class="comment">// Going through each element in the list</span></div>
|
||||
<div class="line"><span class="lineno"> 192</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="charliteral">'\n'</span>;</div>
|
||||
<div class="line"><span class="lineno"> 193</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 194</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << data[i] << <span class="stringliteral">" "</span>; <span class="comment">// print the element</span></div>
|
||||
<div class="line"><span class="lineno"> 195</span> }</div>
|
||||
<div class="line"><span class="lineno"> 196</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -506,22 +512,22 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Sort the list. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> {</div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">//Going through each element in the list</span></div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> uint64_t min_idx = i; <span class="comment">// Initialize the min variable</span></div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">for</span> (uint64_t j = i + 1; j < top; j++) {</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// check whether any element less than current min value</span></div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="keywordflow">if</span> (data[j] < data[min_idx]) {</div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> min_idx = j; <span class="comment">// update index accordingly</span></div>
|
||||
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
|
||||
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> }</div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// swap min value and element at the ith index</span></div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(data[min_idx], data[i]);</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> }</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// mark isSorted variable as true</span></div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> isSorted = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 110</span> {</div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="comment">//Going through each element in the list</span></div>
|
||||
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 113</span> uint64_t min_idx = i; <span class="comment">// Initialize the min variable</span></div>
|
||||
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">for</span> (uint64_t j = i + 1; j < top; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 115</span> <span class="comment">// check whether any element less than current min value</span></div>
|
||||
<div class="line"><span class="lineno"> 116</span> <span class="keywordflow">if</span> (data[j] < data[min_idx]) {</div>
|
||||
<div class="line"><span class="lineno"> 117</span> min_idx = j; <span class="comment">// update index accordingly</span></div>
|
||||
<div class="line"><span class="lineno"> 118</span> }</div>
|
||||
<div class="line"><span class="lineno"> 119</span> }</div>
|
||||
<div class="line"><span class="lineno"> 120</span> <span class="comment">// swap min value and element at the ith index</span></div>
|
||||
<div class="line"><span class="lineno"> 121</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(data[min_idx], data[i]);</div>
|
||||
<div class="line"><span class="lineno"> 122</span> }</div>
|
||||
<div class="line"><span class="lineno"> 123</span> <span class="comment">// mark isSorted variable as true</span></div>
|
||||
<div class="line"><span class="lineno"> 124</span> isSorted = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 125</span> }</div>
|
||||
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -541,7 +547,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="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>list_array</b></li><li class="navelem"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">list</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.2 </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.3 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
<map id="data_structures::list_array::list::sort" name="data_structures::list_array::list::sort">
|
||||
<area shape="rect" id="node1" title="Sort the list." alt="" coords="5,5,143,47"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="191,13,269,39"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap#" title=" " alt="" coords="191,13,269,39"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
a3f1110c29d798a840fa417d020e6e6a
|
||||
784a83b61eb00881a4ced96798fdd453
|
||||
@@ -22,7 +22,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="139,-6 139,-25 198,-25 198,-6 139,-6"/>
|
||||
<text text-anchor="middle" x="168.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.8 KiB After Width: | Height: | Size: 1.8 KiB |
Reference in New Issue
Block a user