backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 341ed50da8

Browse Source
This commit is contained in:
github-actions
2021-09-03 19:56:17 +00:00
parent 52d0c55145
commit 08e8eb037e
3432 changed files with 71392 additions and 72953 deletions
Download Patch File Download Diff File Expand all files Collapse all files

193
d3/d22/saddleback__search_8cpp.html
View File

@@ -2,8 +2,8 @@
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: search/saddleback_search.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -17,9 +17,9 @@
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
@@ -32,8 +32,7 @@
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
@@ -42,21 +41,22 @@
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
@@ -70,7 +70,7 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d3/d22/saddleback__search_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
@@ -93,12 +93,11 @@ $(document).ready(function(){initNavTree('d3/d22/saddleback__search_8cpp.html','
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">saddleback_search.cpp File Reference</div> </div>
<div class="headertitle"><div class="title">saddleback_search.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array">Saddleback Algorithm</a> for 2D arrays.
<p>Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
@@ -110,19 +109,19 @@ Include dependency graph for saddleback_search.cpp:</div>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:d9/dca/namespacesearch"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
<tr class="memitem:d9/dca/namespacesearch"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
<tr class="memdesc:d9/dca/namespacesearch"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d0/dda/namespacesaddleback"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dda/namespacesaddleback.html">saddleback</a></td></tr>
<tr class="memdesc:d0/dda/namespacesaddleback"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array">Saddleback Algorithm</a>. <br /></td></tr>
<tr class="memitem:d0/dda/namespacesaddleback"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dda/namespacesaddleback.html">saddleback</a></td></tr>
<tr class="memdesc:d0/dda/namespacesaddleback"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a0a2f1f1a4c93bb57e8c16b8d08f26916"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916">search::saddleback::saddleback</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&gt; <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#aed8766713ee9b561a4acdcdff5f90ea5">matrix</a>, int32_t element)</td></tr>
<tr class="separator:a0a2f1f1a4c93bb57e8c16b8d08f26916"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad1e0ca34797d88490747c08eca70a2e6"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &gt; <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#aed8766713ee9b561a4acdcdff5f90ea5">matrix</a>, int32_t element)</td></tr>
<tr class="separator:ad1e0ca34797d88490747c08eca70a2e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test implementations. <a href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -131,11 +130,11 @@ Functions</h2></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><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>Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array">Saddleback Algorithm</a> for 2D arrays. </p>
<p>Saddleback Algorithm is an algorithm that searches 2D array in linear time, i.e, O(m + n), where m is number of rows and n is number of columns of 2D array. Also, each row and column of the matrix should be sorted beforehand for this algorithm to work.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/HashirGJ8842">Hashir Niazi</a> </dd></dl>
<div class="textblock"><p >Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays. </p>
<p >Saddleback Algorithm is an algorithm that searches 2D array in linear time, i.e, O(m + n), where m is number of rows and n is number of columns of 2D array. Also, each row and column of the matrix should be sorted beforehand for this algorithm to work.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/HashirGJ8842" target="_blank">Hashir Niazi</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>
<div class="memitem">
@@ -153,10 +152,10 @@ Functions</h2></td></tr>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; {</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <a class="code" href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> {</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span>}</div>
<div class="ttc" id="asaddleback__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> saddleback_search.cpp:70</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -167,16 +166,16 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="a0a2f1f1a4c93bb57e8c16b8d08f26916"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0a2f1f1a4c93bb57e8c16b8d08f26916">&#9670;&nbsp;</a></span>saddleback()</h2>
<a id="ad1e0ca34797d88490747c08eca70a2e6" name="ad1e0ca34797d88490747c08eca70a2e6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad1e0ca34797d88490747c08eca70a2e6">&#9670;&nbsp;</a></span>saddleback()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt;uint32_t, uint32_t&gt; search::saddleback::saddleback </td>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt; search::saddleback::saddleback </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&gt;&#160;</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &gt;&#160;</td>
<td class="paramname"><em>matrix</em>, </td>
</tr>
<tr>
@@ -192,7 +191,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p>This function implements <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array">Saddleback Algorithm</a>, on a sorted 2D array, and finds the location of the element needed to search </p><dl class="params"><dt>Parameters</dt><dd>
<p >This function implements <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a>, on a sorted 2D array, and finds the location of the element needed to search </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">matrix</td><td>2D matrix which is sorted on the basis of rows and columns </td></tr>
<tr><td class="paramname">element</td><td>element to be searched </td></tr>
@@ -202,48 +201,48 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>An <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a> of with row and column populated within it, if the element is present. </dd>
<dd>
An <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a> with (0, 0), if the element is not present. </dd></dl>
<div class="fragment"><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; {</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; uint32_t left_index = 0;</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; uint32_t right_index = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1; <span class="comment">// Start from top right corner</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keywordflow">while</span> (left_index &lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) { <span class="comment">// Exit once the value of indexes get out of range.</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordflow">if</span> (element ==</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; [right_index]) { <span class="comment">// If value on this position of matrix is</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="comment">// equal to element, return (row, column).</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keywordflow">return</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(left_index+1, right_index+1);</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &gt;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; [right_index]) { <span class="comment">// Else if value on this position of</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="comment">// matrix is less than the element,</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="comment">// move left.</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; ++left_index;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &lt;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; [right_index]) { <span class="comment">// Else if value on this position of</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="comment">// matrix is greater than the</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="comment">// element, move down.</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">if</span>(!right_index)</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordflow">else</span> --right_index;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; }</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; }</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">return</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; 0, 0); <span class="comment">// If the program reaches here, that means one of the index</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="comment">// went out of index, hence no element present.</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> uint32_t left_index = 0;</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> uint32_t right_index = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1; <span class="comment">// Start from top right corner</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keywordflow">while</span> (left_index &lt; <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) { <span class="comment">// Exit once the value of indexes get out of range.</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="keywordflow">if</span> (element ==</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> [right_index]) { <span class="comment">// If value on this position of matrix is</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// equal to element, return (row, column).</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(left_index+1, right_index+1);</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &gt;</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> [right_index]) { <span class="comment">// Else if value on this position of</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// matrix is less than the element,</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// move left.</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> ++left_index;</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &lt;</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> [right_index]) { <span class="comment">// Else if value on this position of</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// matrix is greater than the</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// element, move down.</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keywordflow">if</span>(!right_index)</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">else</span> --right_index;</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> }</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> }</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> 0, 0); <span class="comment">// If the program reaches here, that means one of the index</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// went out of index, hence no element present.</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span>}</div>
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d22/saddleback__search_8cpp_a0a2f1f1a4c93bb57e8c16b8d08f26916_cgraph.svg" width="311" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.svg" width="311" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d"></a>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&nbsp;</a></span>test()</h2>
<div class="memitem">
@@ -268,36 +267,36 @@ Here is the call graph for this function:</div>
<p>Test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; {</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int32_t&gt;</a>&gt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a> = {{1, 10, 100, 1000, 10000},</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; {2, 20, 200, 2000, 20000},</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; {3, 30, 300, 3000, 30000},</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; {4, 40, 400, 4000, 40000},</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; {5, 50, 500, 5000, 50000}};</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; </div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> not_found = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, 0);</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> test_answer;</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="comment">// Test 1</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> answer1 = <a class="code" href="../../d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916">search::saddleback::saddleback</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 123);</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; assert(not_found == answer1);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="comment">// Test 2</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; answer1 = <a class="code" href="../../d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916">search::saddleback::saddleback</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 0);</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; assert(not_found == answer1);</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="comment">// Test 3</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; answer1 = <a class="code" href="../../d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916">search::saddleback::saddleback</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 1);</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; test_answer = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(1, 1);</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; assert(test_answer == answer1);</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <span class="comment">// Test 4</span></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; answer1 = <a class="code" href="../../d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916">search::saddleback::saddleback</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 50000);</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; test_answer = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(5, 5);</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; assert(test_answer == answer1);</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="comment">// Test 5</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; answer1 = <a class="code" href="../../d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916">search::saddleback::saddleback</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 300);</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; test_answer = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(3, 3);</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; assert(test_answer == answer1);</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> {</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int32_t&gt;</a>&gt; <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a> = {{1, 10, 100, 1000, 10000},</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> {2, 20, 200, 2000, 20000},</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> {3, 30, 300, 3000, 30000},</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> {4, 40, 400, 4000, 40000},</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> {5, 50, 500, 5000, 50000}};</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> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> not_found = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, 0);</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> test_answer;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// Test 1</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> answer1 = <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 123);</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> assert(not_found == answer1);</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// Test 2</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> answer1 = <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 0);</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> assert(not_found == answer1);</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// Test 3</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> answer1 = <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 1);</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> test_answer = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(1, 1);</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> assert(test_answer == answer1);</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// Test 4</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> answer1 = <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 50000);</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> test_answer = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(5, 5);</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> assert(test_answer == answer1);</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// Test 5</span></div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> answer1 = <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 300);</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> test_answer = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(3, 3);</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> assert(test_answer == answer1);</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span>}</div>
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
<div class="ttc" id="asaddleback__search_8cpp_html_a0a2f1f1a4c93bb57e8c16b8d08f26916"><div class="ttname"><a href="../../d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916">search::saddleback::saddleback</a></div><div class="ttdeci">std::pair&lt; uint32_t, uint32_t &gt; saddleback(std::vector&lt; std::vector&lt; int32_t &gt;&gt; matrix, int32_t element)</div><div class="ttdef"><b>Definition:</b> saddleback_search.cpp:33</div></div>
<div class="ttc" id="asaddleback__search_8cpp_html_ad1e0ca34797d88490747c08eca70a2e6"><div class="ttname"><a href="../../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a></div><div class="ttdeci">std::pair&lt; uint32_t, uint32_t &gt; saddleback(std::vector&lt; std::vector&lt; int32_t &gt; &gt; matrix, int32_t element)</div><div class="ttdef"><b>Definition:</b> saddleback_search.cpp:33</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -313,7 +312,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_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d3/d22/saddleback__search_8cpp.html">saddleback_search.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.1 </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>
</ul>
</div>
</body>