mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 12:23:13 +08:00
310 lines
19 KiB
HTML
310 lines
19 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<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.12.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C++: search/exponential_search.cpp File Reference</title>
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<script type="text/javascript" src="../../clipboard.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<script type="text/javascript" src="../../resize.js"></script>
|
|
<script type="text/javascript" src="../../cookie.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<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"],
|
|
});
|
|
</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>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<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>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.12.0 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() { codefold.init(1); });
|
|
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function(){initNavTree('d8/d8a/exponential__search_8cpp.html','../../'); initResizable(true); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#func-members">Functions</a> </div>
|
|
<div class="headertitle"><div class="title">exponential_search.cpp File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a>
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <cassert></code><br />
|
|
<code>#include <cmath></code><br />
|
|
<code>#include <cstdint></code><br />
|
|
<code>#include <cstring></code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
Include dependency graph for exponential_search.cpp:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d3c/exponential__search_8cpp__incl.svg" width="326" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
|
</div>
|
|
</div><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:ab06cedad209456eae95d37b7cd66acae" id="r_ab06cedad209456eae95d37b7cd66acae"><td class="memTemplParams" colspan="2">template<class Type > </td></tr>
|
|
<tr class="memitem:ab06cedad209456eae95d37b7cd66acae"><td class="memTemplItemLeft" align="right" valign="top">Type * </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab06cedad209456eae95d37b7cd66acae">binary_s</a> (Type *array, size_t size, Type key)</td></tr>
|
|
<tr class="separator:ab06cedad209456eae95d37b7cd66acae"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af421bf4b7b95f20ac86c233adfdb9208" id="r_af421bf4b7b95f20ac86c233adfdb9208"><td class="memTemplParams" colspan="2">template<class Type > </td></tr>
|
|
<tr class="memitem:af421bf4b7b95f20ac86c233adfdb9208"><td class="memTemplItemLeft" align="right" valign="top">Type * </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a> (Type *array, size_t size, Type key)</td></tr>
|
|
<tr class="separator:af421bf4b7b95f20ac86c233adfdb9208"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
|
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a> </p>
|
|
<dl class="section copyright"><dt>Copyright</dt><dd>2020 Divide-et-impera-11</dd></dl>
|
|
<p>The algorithm try to search the range where the key should be. If it has been found we do a binary search there. The range of the search grows by exponential every time. If the key is larger than the last element of array, the start of block(block_front) will be equal to the end of block(block_size) and the algorithm return null ponter, every other cases the algoritm return fom the loop. </p>
|
|
</div><h2 class="groupheader">Function Documentation</h2>
|
|
<a id="ab06cedad209456eae95d37b7cd66acae" name="ab06cedad209456eae95d37b7cd66acae"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ab06cedad209456eae95d37b7cd66acae">◆ </a></span>binary_s()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class Type > </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">Type * binary_s </td>
|
|
<td>(</td>
|
|
<td class="paramtype">Type *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>size</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">Type</td> <td class="paramname"><span class="paramname"><em>key</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Binary Search Algorithm (used by <a class="el" href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a>)<br />
|
|
</p><ul>
|
|
<li>Time Complexity O(log n) where 'n' is the number of elements</li>
|
|
<li>Worst Time Complexity O(log n)</li>
|
|
<li>Best Time Complexity Ω(1)</li>
|
|
<li>Space Complexity O(1)</li>
|
|
<li>Auxiliary Space Complexity O(1) <dl class="section return"><dt>Returns</dt><dd>pointer to value in the array </dd>
|
|
<dd>
|
|
<code>nullptr</code> if value not found </dd></dl>
|
|
</li>
|
|
</ul>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 34</span> {</div>
|
|
<div class="line"><span class="lineno"> 35</span> int32_t lower_index(0), upper_index(size - 1), middle_index;</div>
|
|
<div class="line"><span class="lineno"> 36</span> </div>
|
|
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">while</span> (lower_index <= upper_index) {</div>
|
|
<div class="line"><span class="lineno"> 38</span> middle_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a>((lower_index + upper_index) / 2);</div>
|
|
<div class="line"><span class="lineno"> 39</span> </div>
|
|
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">if</span> (*(array + middle_index) < key)</div>
|
|
<div class="line"><span class="lineno"> 41</span> lower_index = (middle_index + 1);</div>
|
|
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*(array + middle_index) > key)</div>
|
|
<div class="line"><span class="lineno"> 43</span> upper_index = (middle_index - 1);</div>
|
|
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">else</span></div>
|
|
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">return</span> (array + middle_index);</div>
|
|
<div class="line"><span class="lineno"> 46</span> }</div>
|
|
<div class="line"><span class="lineno"> 47</span> </div>
|
|
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><span class="lineno"> 49</span>}</div>
|
|
<div class="ttc" id="afloor_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a></div><div class="ttdeci">T floor(T... args)</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="../../d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.svg" width="202" height="36"><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="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int main </td>
|
|
<td>(</td>
|
|
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Main function </p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 74</span> {</div>
|
|
<div class="line"><span class="lineno"> 75</span> <span class="comment">// TEST CASES</span></div>
|
|
<div class="line"><span class="lineno"> 76</span> <span class="keywordtype">int</span>* sorted_array = <span class="keyword">new</span> <span class="keywordtype">int</span>[7]{7, 10, 15, 23, 70, 105, 203};</div>
|
|
<div class="line"><span class="lineno"> 77</span> assert(<a class="code hl_function" href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search<int></a>(sorted_array, 7, 0) == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><span class="lineno"> 78</span> assert(<a class="code hl_function" href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search<int></a>(sorted_array, 7, 1000) == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><span class="lineno"> 79</span> assert(<a class="code hl_function" href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search<int></a>(sorted_array, 7, 50) == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><span class="lineno"> 80</span> assert(<a class="code hl_function" href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search<int></a>(sorted_array, 7, 7) == sorted_array);</div>
|
|
<div class="line"><span class="lineno"> 81</span> <span class="comment">// TEST CASES</span></div>
|
|
<div class="line"><span class="lineno"> 82</span> <span class="keyword">delete</span>[] sorted_array;</div>
|
|
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><span class="lineno"> 84</span>}</div>
|
|
<div class="ttc" id="aexponential__search_8cpp_html_af421bf4b7b95f20ac86c233adfdb9208"><div class="ttname"><a href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a></div><div class="ttdeci">Type * struzik_search(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition</b> exponential_search.cpp:59</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="../../d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="454" height="36"><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="af421bf4b7b95f20ac86c233adfdb9208" name="af421bf4b7b95f20ac86c233adfdb9208"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af421bf4b7b95f20ac86c233adfdb9208">◆ </a></span>struzik_search()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class Type > </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">Type * struzik_search </td>
|
|
<td>(</td>
|
|
<td class="paramtype">Type *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>size</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">Type</td> <td class="paramname"><span class="paramname"><em>key</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Struzik Search Algorithm(Exponential)</p><ul>
|
|
<li>Time Complexity O(log i) where i is the position of search key in the list</li>
|
|
<li>Worst Time Complexity O(log i)</li>
|
|
<li>Best Time Complexity Ω(1)</li>
|
|
<li>Space Complexity O(1)</li>
|
|
<li>Auxiliary Space Complexity O(1) </li>
|
|
</ul>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
|
|
<div class="line"><span class="lineno"> 60</span> uint32_t block_front(0), block_size = size == 0 ? 0 : 1;</div>
|
|
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">while</span> (block_front != block_size) {</div>
|
|
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span> (*(array + block_size - 1) < key) {</div>
|
|
<div class="line"><span class="lineno"> 63</span> block_front = block_size;</div>
|
|
<div class="line"><span class="lineno"> 64</span> (block_size * 2 - 1 < size) ? (block_size *= 2) : block_size = size;</div>
|
|
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><span class="lineno"> 66</span> }</div>
|
|
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#ab06cedad209456eae95d37b7cd66acae">binary_s<Type></a>(array + block_front, (block_size - block_front),</div>
|
|
<div class="line"><span class="lineno"> 68</span> key);</div>
|
|
<div class="line"><span class="lineno"> 69</span> }</div>
|
|
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><span class="lineno"> 71</span>}</div>
|
|
<div class="ttc" id="aexponential__search_8cpp_html_ab06cedad209456eae95d37b7cd66acae"><div class="ttname"><a href="#ab06cedad209456eae95d37b7cd66acae">binary_s</a></div><div class="ttdeci">Type * binary_s(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition</b> exponential_search.cpp:34</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="../../d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg" width="356" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<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="../../d8/d8a/exponential__search_8cpp.html">exponential_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.12.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|