backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-01 22:13:03 +08:00
Code Issues Projects Releases Wiki Activity
Files
766630cc7008aec2e1ab31ed2c956bbdac6bdce0
C-Plus-Plus/dir_19b2bf9199a15c634a08b1ede1dd896a.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

172 lines
14 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.12.0-->
<!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.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: search Directory Reference</title>
<link rel="icon" href="favicon.svg" type="image/x-icon" />
<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="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</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="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/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygen-awesome.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="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</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">
$(function(){initNavTree('dir_19b2bf9199a15c634a08b1ede1dd896a.html','',''); });
</script>
<div id="container">
<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="headertitle"><div class="title">search Directory Reference</div></div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-files" class="groupheader"><a id="files" name="files"></a>
Files</h2></td></tr>
<tr class="memitem:binary_5Fsearch_2Ecpp" id="r_binary_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/dd5/binary__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>binary_search.cpp</b></td></tr>
<tr class="memitem:exponential_5Fsearch_2Ecpp" id="r_exponential_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/d8a/exponential__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d8a/exponential__search_8cpp.html">exponential_search.cpp</a></td></tr>
<tr class="memdesc:d8/d8a/exponential__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a> <br /></td></tr>
<tr class="memitem:fibonacci_5Fsearch_2Ecpp" id="r_fibonacci_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/d0d/fibonacci__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d0d/fibonacci__search_8cpp.html">fibonacci_search.cpp</a></td></tr>
<tr class="memdesc:de/d0d/fibonacci__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Fibonacci_search_technique" target="_blank">Fibonacci search algorithm</a> <br /></td></tr>
<tr class="memitem:floyd_5Fcycle_5Fdetection_5Falgo_2Ecpp" id="r_floyd_5Fcycle_5Fdetection_5Falgo_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="db/dc4/floyd__cycle__detection__algo_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dc4/floyd__cycle__detection__algo_8cpp.html">floyd_cycle_detection_algo.cpp</a></td></tr>
<tr class="memdesc:db/dc4/floyd__cycle__detection__algo_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm. <br /></td></tr>
<tr class="memitem:hash_5Fsearch_2Ecpp" id="r_hash_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d1/df3/hash__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/df3/hash__search_8cpp.html">hash_search.cpp</a></td></tr>
<tr class="memdesc:d1/df3/hash__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash Search Algorithm - Best Time Complexity Ω(1) <br /></td></tr>
<tr class="memitem:interpolation_5Fsearch_2Ecpp" id="r_interpolation_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/dd7/interpolation__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>interpolation_search.cpp</b></td></tr>
<tr class="memitem:interpolation_5Fsearch2_2Ecpp" id="r_interpolation_5Fsearch2_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/d39/interpolation__search2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d39/interpolation__search2_8cpp.html">interpolation_search2.cpp</a></td></tr>
<tr class="memdesc:df/d39/interpolation__search2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Interpolation_search" target="_blank">Interpolation search</a> algorithm <br /></td></tr>
<tr class="memitem:jump_5Fsearch_2Ecpp" id="r_jump_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d2/d22/jump__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d22/jump__search_8cpp.html">jump_search.cpp</a></td></tr>
<tr class="memdesc:d2/d22/jump__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ program to implement <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">Jump Search</a> <br /></td></tr>
<tr class="memitem:linear_5Fsearch_2Ecpp" id="r_linear_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d02/linear__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d02/linear__search_8cpp.html">linear_search.cpp</a></td></tr>
<tr class="memdesc:d9/d02/linear__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Linear_search" target="_blank">Linear search algorithm</a> <br /></td></tr>
<tr class="memitem:longest_5Fincreasing_5Fsubsequence_5Fusing_5Fbinary_5Fsearch_2Ecpp" id="r_longest_5Fincreasing_5Fsubsequence_5Fusing_5Fbinary_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html">longest_increasing_subsequence_using_binary_search.cpp</a></td></tr>
<tr class="memdesc:d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">find the length of the Longest Increasing Subsequence (LIS) using <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">Binary Search</a> <br /></td></tr>
<tr class="memitem:median_5Fsearch_2Ecpp" id="r_median_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d69/median__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d69/median__search_8cpp.html">median_search.cpp</a></td></tr>
<tr class="memdesc:d9/d69/median__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians" target="_blank">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/" target="_blank">here</a> <br /></td></tr>
<tr class="memitem:median_5Fsearch2_2Ecpp" id="r_median_5Fsearch2_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/dfa/median__search2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dfa/median__search2_8cpp.html">median_search2.cpp</a></td></tr>
<tr class="memdesc:d8/dfa/median__search2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Given a linked list L[0,....,n] of n numbers, find the middle node. <br /></td></tr>
<tr class="memitem:saddleback_5Fsearch_2Ecpp" id="r_saddleback_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/d22/saddleback__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d22/saddleback__search_8cpp.html">saddleback_search.cpp</a></td></tr>
<tr class="memdesc:d3/d22/saddleback__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays. <br /></td></tr>
<tr class="memitem:sublist_5Fsearch_2Ecpp" id="r_sublist_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d5/d45/sublist__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></td></tr>
<tr class="memdesc:d5/d45/sublist__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> <br /></td></tr>
<tr class="memitem:ternary_5Fsearch_2Ecpp" id="r_ternary_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="dc/dfe/ternary__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dfe/ternary__search_8cpp.html">ternary_search.cpp</a></td></tr>
<tr class="memdesc:dc/dfe/ternary__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Ternary_search" target="_blank">Ternary search</a> algorithm <br /></td></tr>
<tr class="memitem:text_5Fsearch_2Ecpp" id="r_text_5Fsearch_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="dc/db5/text__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/db5/text__search_8cpp.html">text_search.cpp</a></td></tr>
<tr class="memdesc:dc/db5/text__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search for words in a long textual paragraph. <br /></td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</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.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink