mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-30 16:51:57 +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++: search/exponential_search.cpp File 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');
|
||||
@@ -177,22 +177,22 @@ template<class Type > </div>
|
||||
<code>nullptr</code> if value not found </dd></dl>
|
||||
</li>
|
||||
</ul>
|
||||
<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> int32_t lower_index(0), upper_index(size - 1), middle_index;</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keywordflow">while</span> (lower_index <= upper_index) {</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><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"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">if</span> (*(array + middle_index) < key)</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> lower_index = (middle_index + 1);</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*(array + middle_index) > key)</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> upper_index = (middle_index - 1);</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">return</span> (array + middle_index);</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> }</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>}</div>
|
||||
<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>
|
||||
@@ -213,17 +213,17 @@ template<class Type > </div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Main function </p>
|
||||
<div class="fragment"><div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> {</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// TEST CASES</span></div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><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"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> assert(struzik_search<int>(sorted_array, 7, 0) == <span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> assert(struzik_search<int>(sorted_array, 7, 1000) == <span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> assert(struzik_search<int>(sorted_array, 7, 50) == <span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> assert(struzik_search<int>(sorted_array, 7, 7) == sorted_array);</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// TEST CASES</span></div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">delete</span>[] sorted_array;</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span>}</div>
|
||||
<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(struzik_search<int>(sorted_array, 7, 0) == <span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><span class="lineno"> 78</span> assert(struzik_search<int>(sorted_array, 7, 1000) == <span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><span class="lineno"> 79</span> assert(struzik_search<int>(sorted_array, 7, 50) == <span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><span class="lineno"> 80</span> assert(struzik_search<int>(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><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -267,19 +267,19 @@ template<class Type > </div>
|
||||
<li>Space Complexity O(1)</li>
|
||||
<li>Auxiliary Space Complexity O(1) </li>
|
||||
</ul>
|
||||
<div class="fragment"><div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> {</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> uint32_t block_front(0), block_size = size == 0 ? 0 : 1;</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">while</span> (block_front != block_size) {</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">if</span> (*(array + block_size - 1) < key) {</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> block_front = block_size;</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> (block_size * 2 - 1 < size) ? (block_size *= 2) : block_size = size;</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> }</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">return</span> binary_s<Type>(array + block_front, (block_size - block_front),</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> key);</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> }</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span>}</div>
|
||||
<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> binary_s<Type>(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><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -289,7 +289,7 @@ template<class Type > </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="../../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.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>
|
||||
|
||||
Reference in New Issue
Block a user