backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-20 20:07:45 +08:00
Code Issues Projects Releases Wiki Activity
Files
64028e7a1387c4a748072bba1ed98203c295d905
C-Plus-Plus/files.html
realstealthninja 64028e7a13 Documentation for b30bdd30bf
2025-08-17 21:49:33 +00:00

534 lines
185 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
<!-- 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++: File List</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('files.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">File List</div></div>
</div><!--header-->
<div class="contents">
<div class="textblock">Here is a list of all documented files with brief descriptions:</div><div class="directory">
<div class="levels">[detail level <span onclick="javascript:dynsection.toggleLevel(1);">1</span><span onclick="javascript:dynsection.toggleLevel(2);">2</span><span onclick="javascript:dynsection.toggleLevel(3);">3</span>]</div><table class="directory">
<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="dynsection.toggleFolder('0_')"><span class="arrowhead closed"></span></span><span id="img_0_" class="iconfolder" onclick="dynsection.toggleFolder('0_')"><div class="folder-icon"></div></span><a class="el" href="dir_c11585dfcef32a26e29098facab6c144.html" target="_self">backtracking</a></td><td class="desc"></td></tr>
<tr id="row_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d1e/generate__parentheses_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/d1e/generate__parentheses_8cpp.html" target="_self">generate_parentheses.cpp</a></td><td class="desc">Well-formed <a href="https://leetcode.com/explore/interview/card/top-interview-questions-medium/109/backtracking/794/" target="_blank">Generated Parentheses</a> with all combinations </td></tr>
<tr id="row_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d40/graph__coloring_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d40/graph__coloring_8cpp.html" target="_self">graph_coloring.cpp</a></td><td class="desc">Prints the assigned colors using <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm </td></tr>
<tr id="row_0_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d2a/knight__tour_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d2a/knight__tour_8cpp.html" target="_self">knight_tour.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm </td></tr>
<tr id="row_0_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d37/magic__sequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>magic_sequence.cpp</b></td><td class="desc"></td></tr>
<tr id="row_0_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/dfb/minimax_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/dfb/minimax_8cpp.html" target="_self">minimax.cpp</a></td><td class="desc">Returns which is the longest/shortest number using <a href="https://en.wikipedia.org/wiki/Minimax" target="_blank">minimax</a> algorithm </td></tr>
<tr id="row_0_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d3e/n__queens_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d3e/n__queens_8cpp.html" target="_self">n_queens.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle </td></tr>
<tr id="row_0_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dac/n__queens__all__solution__optimised_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/dac/n__queens__all__solution__optimised_8cpp.html" target="_self">n_queens_all_solution_optimised.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">N queens</a> all optimized </td></tr>
<tr id="row_0_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d24/nqueen__print__all__solutions_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d24/nqueen__print__all__solutions_8cpp.html" target="_self">nqueen_print_all_solutions.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle, printing all solutions </td></tr>
<tr id="row_0_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d5a/rat__maze_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d5a/rat__maze_8cpp.html" target="_self">rat_maze.cpp</a></td><td class="desc">Implements <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm </td></tr>
<tr id="row_0_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d94/subarray__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d94/subarray__sum_8cpp.html" target="_self">subarray_sum.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset-sum</a> (only continuous subsets) problem </td></tr>
<tr id="row_0_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d5a/subset__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d5a/subset__sum_8cpp.html" target="_self">subset_sum.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem </td></tr>
<tr id="row_0_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d05/sudoku__solver_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d05/sudoku__solver_8cpp.html" target="_self">sudoku_solver.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> algorithm </td></tr>
<tr id="row_0_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d14/wildcard__matching_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d14/wildcard__matching_8cpp.html" target="_self">wildcard_matching.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem </td></tr>
<tr id="row_1_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="dynsection.toggleFolder('1_')"><span class="arrowhead closed"></span></span><span id="img_1_" class="iconfolder" onclick="dynsection.toggleFolder('1_')"><div class="folder-icon"></div></span><a class="el" href="dir_f3c4fbc4e901afa0a54d0623c5574aa7.html" target="_self">bit_manipulation</a></td><td class="desc"></td></tr>
<tr id="row_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d56/count__bits__flip_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d56/count__bits__flip_8cpp.html" target="_self">count_bits_flip.cpp</a></td><td class="desc">Implementation to [Count number of bits to be flipped to convert A to B] (<a href="https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/">https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/</a>) in an integer </td></tr>
<tr id="row_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/db8/count__of__set__bits_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/db8/count__of__set__bits_8cpp.html" target="_self">count_of_set_bits.cpp</a></td><td class="desc">Implementation to [count number of set bits of a number] (<a href="https://www.geeksforgeeks.org/count-set-bits-in-an-integer/">https://www.geeksforgeeks.org/count-set-bits-in-an-integer/</a>) in an integer </td></tr>
<tr id="row_1_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html" target="_self">count_of_trailing_ciphers_in_factorial_n.cpp</a></td><td class="desc"><a href="https://www.tutorialspoint.com/count-trailing-zeros-in-factorial-of-a-number-in-cplusplus" target="_blank">Count the number of ciphers</a> in <span class="tt">n!</span> implementation </td></tr>
<tr id="row_1_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d38/find__non__repeating__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d38/find__non__repeating__number_8cpp.html" target="_self">find_non_repeating_number.cpp</a></td><td class="desc">Implementation to find the non repeating integer in an array of repeating integers. <a href="https://leetcode.com/problems/single-number/" target="_blank">Single Number</a> </td></tr>
<tr id="row_1_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d8b/gray__code_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>gray_code.cpp</b></td><td class="desc"></td></tr>
<tr id="row_1_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d48/hamming__distance_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d48/hamming__distance_8cpp.html" target="_self">hamming_distance.cpp</a></td><td class="desc">Returns the <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> between two integers </td></tr>
<tr id="row_1_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html" target="_self">next_higher_number_with_same_number_of_set_bits.cpp</a></td><td class="desc">[Next higher number with same number of set bits] (<a href="https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/">https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/</a>) implementation </td></tr>
<tr id="row_1_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d6d/power__of__2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d6d/power__of__2_8cpp.html" target="_self">power_of_2.cpp</a></td><td class="desc">[Find whether a given number is power of 2] (<a href="https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/">https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/</a>) implementation </td></tr>
<tr id="row_1_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/db5/set__kth__bit_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/db5/set__kth__bit_8cpp.html" target="_self">set_kth_bit.cpp</a></td><td class="desc">Implementation to [From the right, set the Kth bit in the binary representation of N] (<a href="https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/">https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/</a>) in an integer </td></tr>
<tr id="row_1_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html" target="_self">travelling_salesman_using_bit_manipulation.cpp</a></td><td class="desc">Implementation to [Travelling Salesman problem using bit-masking] (<a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/">https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/</a>) </td></tr>
<tr id="row_2_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="dynsection.toggleFolder('2_')"><span class="arrowhead closed"></span></span><span id="img_2_" class="iconfolder" onclick="dynsection.toggleFolder('2_')"><div class="folder-icon"></div></span><a class="el" href="dir_4d6e05837bf820fb089a8a8cdf2f42b7.html" target="_self">ciphers</a></td><td class="desc"></td></tr>
<tr id="row_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/db6/a1z26__cipher_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/db6/a1z26__cipher_8cpp.html" target="_self">a1z26_cipher.cpp</a></td><td class="desc">Implementation of the <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26 cipher</a> </td></tr>
<tr id="row_2_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/dfb/atbash__cipher_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/dfb/atbash__cipher_8cpp.html" target="_self">atbash_cipher.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Atbash" target="_blank">Atbash Cipher</a> implementation </td></tr>
<tr id="row_2_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d1c/base64__encoding_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>base64_encoding.cpp</b></td><td class="desc"></td></tr>
<tr id="row_2_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d2c/caesar__cipher_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d2c/caesar__cipher_8cpp.html" target="_self">caesar_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Caesar_cipher" target="_blank">Caesar cipher</a> algorithm </td></tr>
<tr id="row_2_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d2c/elliptic__curve__key__exchange_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d2c/elliptic__curve__key__exchange_8cpp.html" target="_self">elliptic_curve_key_exchange.cpp</a></td><td class="desc">Implementation of <a href="https://cryptobook.nakov.com/asymmetric-key-ciphers/ecdh-key-exchange" target="_blank">Elliptic Curve Diffie Hellman Key Exchange</a> </td></tr>
<tr id="row_2_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/db9/hill__cipher_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/db9/hill__cipher_8cpp.html" target="_self">hill_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill cipher</a> algorithm </td></tr>
<tr id="row_2_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d76/morse__code_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d76/morse__code_8cpp.html" target="_self">morse_code.cpp</a></td><td class="desc">Implementation of [Morse Code] (<a href="https://en.wikipedia.org/wiki/Morse_code">https://en.wikipedia.org/wiki/Morse_code</a>) </td></tr>
<tr id="row_2_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d41/uint128__t_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d41/uint128__t_8hpp.html" target="_self">uint128_t.hpp</a></td><td class="desc"></td></tr>
<tr id="row_2_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/da3/uint256__t_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/da3/uint256__t_8hpp.html" target="_self">uint256_t.hpp</a></td><td class="desc"></td></tr>
<tr id="row_2_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d12/vigenere__cipher_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/d12/vigenere__cipher_8cpp.html" target="_self">vigenere_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">Vigenère cipher</a> algorithm </td></tr>
<tr id="row_2_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d4c/xor__cipher_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d4c/xor__cipher_8cpp.html" target="_self">xor_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm </td></tr>
<tr id="row_3_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="dynsection.toggleFolder('3_')"><span class="arrowhead closed"></span></span><span id="img_3_" class="iconfolder" onclick="dynsection.toggleFolder('3_')"><div class="folder-icon"></div></span><a class="el" href="dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html" target="_self">cpu_scheduling_algorithms</a></td><td class="desc"></td></tr>
<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d47/fcfs__scheduling_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d47/fcfs__scheduling_8cpp.html" target="_self">fcfs_scheduling.cpp</a></td><td class="desc">Implementation of <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> CPU scheduling algorithm </td></tr>
<tr id="row_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d1a/non__preemptive__sjf__scheduling_8cpp.html" target="_self">non_preemptive_sjf_scheduling.cpp</a></td><td class="desc">Implementation of <a class="el" href="d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> CPU scheduling algorithm </td></tr>
<tr id="row_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="dynsection.toggleFolder('4_')"><span class="arrowhead closed"></span></span><span id="img_4_" class="iconfolder" onclick="dynsection.toggleFolder('4_')"><div class="folder-icon"></div></span><a class="el" href="dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html" target="_self">data_structures</a></td><td class="desc"></td></tr>
<tr id="row_4_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_4_0_" class="arrow" onclick="dynsection.toggleFolder('4_0_')"><span class="arrowhead closed"></span></span><span id="img_4_0_" class="iconfolder" onclick="dynsection.toggleFolder('4_0_')"><div class="folder-icon"></div></span><a class="el" href="dir_f1797d0c2a0a12033e7d74efffeb14e1.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_4_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d1/d70/cll_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>cll.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d7/dba/cll_8h_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>cll.h</b></td><td class="desc"></td></tr>
<tr id="row_4_0_2_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="df/d97/main__cll_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>main_cll.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dee/avltree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/dee/avltree_8cpp.html" target="_self">avltree.cpp</a></td><td class="desc">A simple tree implementation using nodes </td></tr>
<tr id="row_4_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d26/binary__search__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d26/binary__search__tree_8cpp.html" target="_self">binary_search_tree.cpp</a></td><td class="desc">A simple tree implementation using structured nodes </td></tr>
<tr id="row_4_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d42/binary__search__tree2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d42/binary__search__tree2_8cpp.html" target="_self">binary_search_tree2.cpp</a></td><td class="desc">A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation. Here you can find more information about the algorithm: <a href="https://www.scaler.com/topics/data-structures/binary-search-tree/" target="_blank">Scaler - Binary Search tree</a> </td></tr>
<tr id="row_4_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dc3/binaryheap_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dc3/binaryheap_8cpp.html" target="_self">binaryheap.cpp</a></td><td class="desc">A C++ program to demonstrate common Binary Heap Operations </td></tr>
<tr id="row_4_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dab/bloom__filter_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/dab/bloom__filter_8cpp.html" target="_self">bloom_filter.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bloom_filter" target="_blank">Bloom Filter</a> generic implementation in C++ </td></tr>
<tr id="row_4_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dfd/circular__queue__using__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>circular_queue_using_linked_list.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d23/disjoint__set_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d23/disjoint__set_8cpp.html" target="_self">disjoint_set.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> </td></tr>
<tr id="row_4_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d85/doubly__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>doubly_linked_list.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dae/dsu__path__compression_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/dae/dsu__path__compression_8cpp.html" target="_self">dsu_path_compression.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </td></tr>
<tr id="row_4_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d28/dsu__union__rank_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d28/dsu__union__rank_8cpp.html" target="_self">dsu_union_rank.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </td></tr>
<tr id="row_4_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dc3/linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/dc3/linked__list_8cpp.html" target="_self">linked_list.cpp</a></td><td class="desc">Implementation of singly linked list algorithm </td></tr>
<tr id="row_4_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dce/linkedlist__implentation__usingarray_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html" target="_self">linkedlist_implentation_usingarray.cpp</a></td><td class="desc">Linked list implementation using Arrays </td></tr>
<tr id="row_4_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d00/list__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d00/list__array_8cpp.html" target="_self">list_array.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> </td></tr>
<tr id="row_4_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/dc5/morrisinorder_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>morrisinorder.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d09/node_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d09/node_8hpp.html" target="_self">node.hpp</a></td><td class="desc">Provides <a class="el" href="db/d8b/struct_node.html">Node</a> class and related utilities </td></tr>
<tr id="row_4_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/ded/queue_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>queue.hpp</b></td><td class="desc"></td></tr>
<tr id="row_4_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/df0/queue__using__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/df0/queue__using__array_8cpp.html" target="_self">queue_using_array.cpp</a></td><td class="desc">Implementation of Linear [<a class="el" href="dc/db5/struct_queue.html">Queue</a> using array] (<a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">https://www.geeksforgeeks.org/array-implementation-of-queue-simple/</a>) </td></tr>
<tr id="row_4_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/da7/queue__using__array2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>queue_using_array2.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/db7/queue__using__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>queue_using_linked_list.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d5b/queue__using__linkedlist_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>queue_using_linkedlist.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/dd0/queue__using__two__stacks_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html" target="_self">queue_using_two_stacks.cpp</a></td><td class="desc"></td></tr>
<tr id="row_4_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dad/rb__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>rb_tree.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d05/reverse__a__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d05/reverse__a__linked__list_8cpp.html" target="_self">reverse_a_linked_list.cpp</a></td><td class="desc">Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> </td></tr>
<tr id="row_4_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dd1/segment__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dd1/segment__tree_8cpp.html" target="_self">segment_tree.cpp</a></td><td class="desc">A data structure to quickly do operations on ranges: the <a href="https://en.wikipedia.org/wiki/Segment_tree" target="_blank">Segment Tree</a> algorithm implementation </td></tr>
<tr id="row_4_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d5a/skip__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
<tr id="row_4_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dab/sparse__table_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/dab/sparse__table_8cpp.html" target="_self">sparse_table.cpp</a></td><td class="desc">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <span class="tt">min()</span> function </td></tr>
<tr id="row_4_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d47/stack_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d47/stack_8hpp.html" target="_self">stack.hpp</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
<tr id="row_4_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d96/stack__using__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>stack_using_array.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dea/stack__using__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>stack_using_linked_list.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d43/stack__using__queue_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>stack_using_queue.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dce/test__queue_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>test_queue.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dbf/test__stack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>test_stack.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dbd/test__stack__students_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>test_stack_students.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/dd2/treap_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/dd2/treap_8cpp.html" target="_self">treap.cpp</a></td><td class="desc">A balanced binary search tree (BST) on the basis of binary search tree and heap: the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation </td></tr>
<tr id="row_4_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d12/tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>tree.cpp</b></td><td class="desc"></td></tr>
<tr id="row_4_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dbc/tree__234_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/dbc/tree__234_8cpp.html" target="_self">tree_234.cpp</a></td><td class="desc">A demo 2-3-4 tree implementation </td></tr>
<tr id="row_4_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d93/trie__modern_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
<tr id="row_4_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d83/trie__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d83/trie__tree_8cpp.html" target="_self">trie_tree.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure for English alphabets in small characters </td></tr>
<tr id="row_4_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d8a/trie__using__hashmap_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d8a/trie__using__hashmap_8cpp.html" target="_self">trie_using_hashmap.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix </td></tr>
<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="dynsection.toggleFolder('5_')"><span class="arrowhead closed"></span></span><span id="img_5_" class="iconfolder" onclick="dynsection.toggleFolder('5_')"><div class="folder-icon"></div></span><a class="el" href="dir_93bc990c5cceb745f78af6949e9ef947.html" target="_self">divide_and_conquer</a></td><td class="desc"></td></tr>
<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html" target="_self">karatsuba_algorithm_for_fast_multiplication.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> </td></tr>
<tr id="row_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/dea/strassen__matrix__multiplication_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>strassen_matrix_multiplication.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_6_" class="arrow" onclick="dynsection.toggleFolder('6_')"><span class="arrowhead closed"></span></span><span id="img_6_" class="iconfolder" onclick="dynsection.toggleFolder('6_')"><div class="folder-icon"></div></span><a class="el" href="dir_8a20dd5bfd5341a725342bf72b6b686f.html" target="_self">dynamic_programming</a></td><td class="desc"></td></tr>
<tr id="row_6_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d16/0__1__knapsack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d16/0__1__knapsack_8cpp.html" target="_self">0_1_knapsack.cpp</a></td><td class="desc">Implementation of [0-1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem] (<a href="https://en.wikipedia.org/wiki/Knapsack_problem">https://en.wikipedia.org/wiki/Knapsack_problem</a>) </td></tr>
<tr id="row_6_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d73/abbreviation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d73/abbreviation_8cpp.html" target="_self">abbreviation.cpp</a></td><td class="desc">Implementation of <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbrievation</a> </td></tr>
<tr id="row_6_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/da7/armstrong__number__templated_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/da7/armstrong__number__templated_8cpp.html" target="_self">armstrong_number_templated.cpp</a></td><td class="desc">Checks whether a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong Number</a> or not </td></tr>
<tr id="row_6_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d14/bellman__ford_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>bellman_ford.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dd9/catalan__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dd9/catalan__numbers_8cpp.html" target="_self">catalan_numbers.cpp</a></td><td class="desc">Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: <a href="https://en.wikipedia.org/wiki/Catalan_number">https://en.wikipedia.org/wiki/Catalan_number</a> <a href="https://oeis.org/A000108/">https://oeis.org/A000108/</a> </td></tr>
<tr id="row_6_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d6b/coin__change_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>coin_change.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d31/coin__change__topdown_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d31/coin__change__topdown_8cpp.html" target="_self">coin_change_topdown.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/coin-change/" target="_blank">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount </td></tr>
<tr id="row_6_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d10/cut__rod_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d10/cut__rod_8cpp.html" target="_self">cut_rod.cpp</a></td><td class="desc">Implementation of cutting a rod problem </td></tr>
<tr id="row_6_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d82/edit__distance_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>edit_distance.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d7d/egg__dropping__puzzle_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>egg_dropping_puzzle.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d7c/fibonacci__bottom__up_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>fibonacci_bottom_up.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d31/floyd__warshall_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>floyd_warshall.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d26/house__robber_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d26/house__robber_8cpp.html" target="_self">house_robber.cpp</a></td><td class="desc">Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm </td></tr>
<tr id="row_6_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/da0/kadane_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/da0/kadane_8cpp.html" target="_self">kadane.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> </td></tr>
<tr id="row_6_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d0d/longest__common__string_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d0d/longest__common__string_8cpp.html" target="_self">longest_common_string.cpp</a></td><td class="desc">Definition of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
<tr id="row_6_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/def/longest__common__subsequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>longest_common_subsequence.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d57/longest__increasing__subsequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html" target="_self">longest_increasing_subsequence.cpp</a></td><td class="desc">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array </td></tr>
<tr id="row_6_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>longest_increasing_subsequence_nlogn.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d77/longest__palindromic__subsequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html" target="_self">longest_palindromic_subsequence.cpp</a></td><td class="desc">Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string </td></tr>
<tr id="row_6_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/da2/matrix__chain__multiplication_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>matrix_chain_multiplication.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dfb/maximum__circular__subarray_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/dfb/maximum__circular__subarray_8cpp.html" target="_self">maximum_circular_subarray.cpp</a></td><td class="desc">C++ program for maximum contiguous circular sum problem using <a href="https://en.wikipedia.org/wiki/Maximum_subarray_problem" target="_blank">Kadane's Algorithm</a> </td></tr>
<tr id="row_6_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d52/minimum__edit__distance_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d52/minimum__edit__distance_8cpp.html" target="_self">minimum_edit_distance.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing </td></tr>
<tr id="row_6_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d90/palindrome__partitioning_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d90/palindrome__partitioning_8cpp.html" target="_self">palindrome_partitioning.cpp</a></td><td class="desc">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make </td></tr>
<tr id="row_6_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d8c/partition__problem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>partition_problem.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d68/searching__of__element__in__dynamic__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>searching_of_element_in_dynamic_array.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d65/shortest__common__supersequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html" target="_self">shortest_common_supersequence.cpp</a></td><td class="desc">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) </td></tr>
<tr id="row_6_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d67/subset__sum__dynamic_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d67/subset__sum__dynamic_8cpp.html" target="_self">subset_sum_dynamic.cpp</a></td><td class="desc">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not </td></tr>
<tr id="row_6_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d80/trapped__rainwater_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d80/trapped__rainwater_8cpp.html" target="_self">trapped_rainwater.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> </td></tr>
<tr id="row_6_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/de3/trapped__rainwater2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/de3/trapped__rainwater2_8cpp.html" target="_self">trapped_rainwater2.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> </td></tr>
<tr id="row_6_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d77/tree__height_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>tree_height.cpp</b></td><td class="desc"></td></tr>
<tr id="row_6_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dec/unbounded__0__1__knapsack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/dec/unbounded__0__1__knapsack_8cpp.html" target="_self">unbounded_0_1_knapsack.cpp</a></td><td class="desc">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem </td></tr>
<tr id="row_6_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d84/word__break_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> </td></tr>
<tr id="row_7_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="dynsection.toggleFolder('7_')"><span class="arrowhead closed"></span></span><span id="img_7_" class="iconfolder" onclick="dynsection.toggleFolder('7_')"><div class="folder-icon"></div></span><a class="el" href="dir_4b6f782e158b0b98da980a0e11a23a15.html" target="_self">games</a></td><td class="desc"></td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d92/memory__game_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/d92/memory__game_8cpp.html" target="_self">memory_game.cpp</a></td><td class="desc">A simple <a href="https://en.wikipedia.org/wiki/Matching_game" target="_blank">Memory Game</a> with <b>3 different sizes</b> and multiple letters </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="dynsection.toggleFolder('8_')"><span class="arrowhead closed"></span></span><span id="img_8_" class="iconfolder" onclick="dynsection.toggleFolder('8_')"><div class="folder-icon"></div></span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>
<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d79/graham__scan__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>graham_scan_algorithm.cpp</b></td><td class="desc"></td></tr>
<tr id="row_8_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d89/graham__scan__functions_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>graham_scan_functions.hpp</b></td><td class="desc"></td></tr>
<tr id="row_8_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d8d/jarvis__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html" target="_self">jarvis_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm </td></tr>
<tr id="row_8_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d6c/line__segment__intersection_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html" target="_self">line_segment_intersection.cpp</a></td><td class="desc">Check whether two line segments intersect each other or not </td></tr>
<tr id="row_9_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="dynsection.toggleFolder('9_')"><span class="arrowhead closed"></span></span><span id="img_9_" class="iconfolder" onclick="dynsection.toggleFolder('9_')"><div class="folder-icon"></div></span><a class="el" href="dir_12552d7fa429bf94a2e32e5cf39f7e69.html" target="_self">graph</a></td><td class="desc"></td></tr>
<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d07/bidirectional__dijkstra_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html" target="_self">bidirectional_dijkstra.cpp</a></td><td class="desc">[Bidirectional Dijkstra Shortest Path Algorithm] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) </td></tr>
<tr id="row_9_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d82/breadth__first__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d82/breadth__first__search_8cpp.html" target="_self">breadth_first_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Breadth-first_search" target="_blank">Breadth First Search Algorithm (Breadth First Search)</a> </td></tr>
<tr id="row_9_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>bridge_finding_with_tarjan_algorithm.cpp</b></td><td class="desc"></td></tr>
<tr id="row_9_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/ddd/connected__components_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/ddd/connected__components_8cpp.html" target="_self">connected_components.cpp</a></td><td class="desc">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Connected Components (Connected Components)] (<a href="https://en.wikipedia.org/wiki/Component_(graph_theory)">https://en.wikipedia.org/wiki/Component_(graph_theory)</a>) </td></tr>
<tr id="row_9_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d99/connected__components__with__dsu_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d99/connected__components__with__dsu_8cpp.html" target="_self">connected_components_with_dsu.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> </td></tr>
<tr id="row_9_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dec/cycle__check__directed__graph_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>cycle_check_directed_graph.cpp</b></td><td class="desc"></td></tr>
<tr id="row_9_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d8d/depth__first__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d8d/depth__first__search_8cpp.html" target="_self">depth_first_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm (Depth First Search)</a> </td></tr>
<tr id="row_9_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d4b/depth__first__search__with__stack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html" target="_self">depth_first_search_with_stack.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm using Stack (Depth First Search Algorithm)</a> </td></tr>
<tr id="row_9_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d68/dijkstra_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d68/dijkstra_8cpp.html" target="_self">dijkstra.cpp</a></td><td class="desc">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (<a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm</a>) </td></tr>
<tr id="row_9_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d0c/hamiltons__cycle_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html" target="_self">hamiltons_cycle.cpp</a></td><td class="desc">The implementation of <a href="https://en.wikipedia.org/wiki/Hamiltonian_path" target="_blank">Hamilton's cycle</a> dynamic solution for vertices number less than 20 </td></tr>
<tr id="row_9_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d9a/hopcroft__karp_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d9a/hopcroft__karp_8cpp.html" target="_self">hopcroft_karp.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm" target="_blank">Hopcroft–Karp</a> algorithm </td></tr>
<tr id="row_9_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/dd8/is__graph__bipartite_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html" target="_self">is_graph_bipartite.cpp</a></td><td class="desc">Algorithm to check whether a graph is <a href="https://en.wikipedia.org/wiki/Bipartite_graph" target="_blank">bipartite</a> </td></tr>
<tr id="row_9_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/dc3/is__graph__bipartite2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>is_graph_bipartite2.cpp</b></td><td class="desc"></td></tr>
<tr id="row_9_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d83/kosaraju_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>kosaraju.cpp</b></td><td class="desc"></td></tr>
<tr id="row_9_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d1c/kruskal_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>kruskal.cpp</b></td><td class="desc"></td></tr>
<tr id="row_9_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dde/lowest__common__ancestor_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dde/lowest__common__ancestor_8cpp.html" target="_self">lowest_common_ancestor.cpp</a></td><td class="desc">Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting </td></tr>
<tr id="row_9_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</b></td><td class="desc"></td></tr>
<tr id="row_9_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d32/number__of__paths_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d32/number__of__paths_8cpp.html" target="_self">number_of_paths.cpp</a></td><td class="desc">Algorithm to count paths between two nodes in a directed graph using DFS </td></tr>
<tr id="row_9_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d27/prim_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>prim.cpp</b></td><td class="desc"></td></tr>
<tr id="row_9_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/db9/topological__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/db9/topological__sort_8cpp.html" target="_self">topological_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Topological_sorting" target="_blank">Topological Sort Algorithm</a> </td></tr>
<tr id="row_9_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>topological_sort_by_kahns_algo.cpp</b></td><td class="desc"></td></tr>
<tr id="row_9_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d88/travelling__salesman__problem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d88/travelling__salesman__problem_8cpp.html" target="_self">travelling_salesman_problem.cpp</a></td><td class="desc">[Travelling Salesman Problem] (<a href="https://en.wikipedia.org/wiki/Travelling_salesman_problem">https://en.wikipedia.org/wiki/Travelling_salesman_problem</a>) implementation </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="dynsection.toggleFolder('10_')"><span class="arrowhead closed"></span></span><span id="img_10_" class="iconfolder" onclick="dynsection.toggleFolder('10_')"><div class="folder-icon"></div></span><a class="el" href="dir_e79632891301b850df87e9c0030293fa.html" target="_self">graphics</a></td><td class="desc"></td></tr>
<tr id="row_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d77/spirograph_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d77/spirograph_8cpp.html" target="_self">spirograph.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph" target="_blank">Spirograph</a> </td></tr>
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="dynsection.toggleFolder('11_')"><span class="arrowhead closed"></span></span><span id="img_11_" class="iconfolder" onclick="dynsection.toggleFolder('11_')"><div class="folder-icon"></div></span><a class="el" href="dir_0eaa691bd54ab0922ca7f50599de6d22.html" target="_self">greedy_algorithms</a></td><td class="desc"></td></tr>
<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d1f/binary__addition_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d1f/binary__addition_8cpp.html" target="_self">binary_addition.cpp</a></td><td class="desc">Adds two binary numbers and outputs resulting string </td></tr>
<tr id="row_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html" target="_self">boruvkas_minimum_spanning_tree.cpp</a></td><td class="desc">[Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) to find the <a class="el" href="d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning Tree </td></tr>
<tr id="row_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d36/digit__separation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d36/digit__separation_8cpp.html" target="_self">digit_separation.cpp</a></td><td class="desc">Separates digits from numbers in forward and reverse order </td></tr>
<tr id="row_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/de8/dijkstra__greedy_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/de8/dijkstra__greedy_8cpp.html" target="_self">dijkstra_greedy.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
<tr id="row_11_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d80/gale__shapley_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d80/gale__shapley_8cpp.html" target="_self">gale_shapley.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> </td></tr>
<tr id="row_11_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d8e/huffman_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>huffman.cpp</b></td><td class="desc"></td></tr>
<tr id="row_11_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/dba/jump__game_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/dba/jump__game_8cpp.html" target="_self">jump_game.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation </td></tr>
<tr id="row_11_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d61/knapsack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>knapsack.cpp</b></td><td class="desc"></td></tr>
<tr id="row_11_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html" target="_self">kruskals_minimum_spanning_tree.cpp</a></td><td class="desc"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation </td></tr>
<tr id="row_11_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d64/prims__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>prims_minimum_spanning_tree.cpp</b></td><td class="desc"></td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="dynsection.toggleFolder('12_')"><span class="arrowhead closed"></span></span><span id="img_12_" class="iconfolder" onclick="dynsection.toggleFolder('12_')"><div class="folder-icon"></div></span><a class="el" href="dir_ece9b94c107bbaa1dd68197a8c9983b9.html" target="_self">hashing</a></td><td class="desc"></td></tr>
<tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d92/chaining_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d92/chaining_8cpp.html" target="_self">chaining.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hash_chain" target="_blank">hash chains</a> </td></tr>
<tr id="row_12_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d80/double__hash__hash__table_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d80/double__hash__hash__table_8cpp.html" target="_self">double_hash_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double-hashed keys</a> </td></tr>
<tr id="row_12_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dc7/linear__probing__hash__table_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html" target="_self">linear_probing_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing hash</a> keys </td></tr>
<tr id="row_12_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d96/md5_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d96/md5_8cpp.html" target="_self">md5.cpp</a></td><td class="desc">Simple C++ implementation of the <a href="https://en.wikipedia.org/wiki/MD5" target="_blank">MD5 Hashing Algorithm</a> </td></tr>
<tr id="row_12_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d71/quadratic__probing__hash__table_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html" target="_self">quadratic_probing_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing hash</a> keys </td></tr>
<tr id="row_12_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d7a/sha1_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d7a/sha1_8cpp.html" target="_self">sha1.cpp</a></td><td class="desc">Simple C++ implementation of the <a href="https://en.wikipedia.org/wiki/SHA-1" target="_blank">SHA-1 Hashing Algorithm</a> </td></tr>
<tr id="row_12_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d08/sha256_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d08/sha256_8cpp.html" target="_self">sha256.cpp</a></td><td class="desc">Simple C++ implementation of the [SHA-256 Hashing Algorithm] (<a href="https://en.wikipedia.org/wiki/SHA-2">https://en.wikipedia.org/wiki/SHA-2</a>) </td></tr>
<tr id="row_13_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="dynsection.toggleFolder('13_')"><span class="arrowhead closed"></span></span><span id="img_13_" class="iconfolder" onclick="dynsection.toggleFolder('13_')"><div class="folder-icon"></div></span><a class="el" href="dir_3343723ae086de42ee4ca9774da3a13f.html" target="_self">machine_learning</a></td><td class="desc"></td></tr>
<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/dec/a__star__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>a_star_search.cpp</b></td><td class="desc"></td></tr>
<tr id="row_13_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/db0/adaline__learning_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/db0/adaline__learning_8cpp.html" target="_self">adaline_learning.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/ADALINE" target="_blank">Adaptive Linear Neuron (ADALINE)</a> implementation </td></tr>
<tr id="row_13_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d3e/k__nearest__neighbors_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d3e/k__nearest__neighbors_8cpp.html" target="_self">k_nearest_neighbors.cpp</a></td><td class="desc">Implementation of [K-Nearest Neighbors algorithm] (<a href="https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm">https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm</a>) </td></tr>
<tr id="row_13_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/def/kohonen__som__topology_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/def/kohonen__som__topology_8cpp.html" target="_self">kohonen_som_topology.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (topological map) </td></tr>
<tr id="row_13_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d49/kohonen__som__trace_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d49/kohonen__som__trace_8cpp.html" target="_self">kohonen_som_trace.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (data tracing) </td></tr>
<tr id="row_13_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d58/neural__network_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d58/neural__network_8cpp.html" target="_self">neural_network.cpp</a></td><td class="desc">Implementation of [Multilayer Perceptron] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>) </td></tr>
<tr id="row_13_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d38/ordinary__least__squares__regressor_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html" target="_self">ordinary_least_squares_regressor.cpp</a></td><td class="desc">Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares" target="_blank">Ordinary least squares</a> </td></tr>
<tr id="row_13_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d95/vector__ops_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d95/vector__ops_8hpp.html" target="_self">vector_ops.hpp</a></td><td class="desc">Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>) </td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="dynsection.toggleFolder('14_')"><span class="arrowhead closed"></span></span><span id="img_14_" class="iconfolder" onclick="dynsection.toggleFolder('14_')"><div class="folder-icon"></div></span><a class="el" href="dir_296d53ceaeaa7e099814a6def439fe8a.html" target="_self">math</a></td><td class="desc"></td></tr>
<tr id="row_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d99/aliquot__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d99/aliquot__sum_8cpp.html" target="_self">aliquot_sum.cpp</a></td><td class="desc">Program to return the <a href="https://en.wikipedia.org/wiki/Aliquot_sum" target="_blank">Aliquot Sum</a> of a number </td></tr>
<tr id="row_14_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d51/approximate__pi_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d51/approximate__pi_8cpp.html" target="_self">approximate_pi.cpp</a></td><td class="desc">Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a> </td></tr>
<tr id="row_14_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d82/area_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d82/area_8cpp.html" target="_self">area.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes </td></tr>
<tr id="row_14_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d1e/armstrong__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>armstrong_number.cpp</b></td><td class="desc"></td></tr>
<tr id="row_14_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dcf/binary__exponent_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr>
<tr id="row_14_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/db1/binomial__calculate_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr>
<tr id="row_14_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/df6/check__amicable__pair_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr>
<tr id="row_14_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dd5/check__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not </td></tr>
<tr id="row_14_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d93/check__prime_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">A simple program to check if the given number is <a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Prime</a> or not </td></tr>
<tr id="row_14_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d67/complex__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr>
<tr id="row_14_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d89/double__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d89/double__factorial_8cpp.html" target="_self">double_factorial.cpp</a></td><td class="desc">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\) </td></tr>
<tr id="row_14_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/da6/eratosthenes_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/da6/eratosthenes_8cpp.html" target="_self">eratosthenes.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">The Sieve of Eratosthenes</a> </td></tr>
<tr id="row_14_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d23/eulers__totient__function_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> @description Euler Totient Function is also known as phi function </td></tr>
<tr id="row_14_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d5d/extended__euclid__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) </td></tr>
<tr id="row_14_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d00/factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">Find the <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of a given number </td></tr>
<tr id="row_14_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d0b/fast__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
<tr id="row_14_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d89/fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">N-th <a href="https://en.wikipedia.org/wiki/Fibonacci_sequence" target="_blank">Fibonacci number</a> </td></tr>
<tr id="row_14_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d32/fibonacci__fast_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
<tr id="row_14_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/de4/fibonacci__large_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
<tr id="row_14_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
<tr id="row_14_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dc3/fibonacci__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) +
\mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
<tr id="row_14_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
<tr id="row_14_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/da0/gcd__iterative__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d11/gcd__of__n__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers </td></tr>
<tr id="row_14_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d45/gcd__recursive__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/de9/integral__approximation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
<tr id="row_14_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d40/integral__approximation2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
<tr id="row_14_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/db8/inv__sqrt_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
<tr id="row_14_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d9f/iterative__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d9f/iterative__factorial_8cpp.html" target="_self">iterative_factorial.cpp</a></td><td class="desc">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> </td></tr>
<tr id="row_14_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d9d/large__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
<tr id="row_14_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
<tr id="row_14_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d7a/largest__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
<tr id="row_14_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d83/lcm__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) +
\mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) </td></tr>
<tr id="row_14_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d21/least__common__multiple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>linear_recurrence_matrix.cpp</b></td><td class="desc"></td></tr>
<tr id="row_14_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d44/magic__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
<tr id="row_14_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d42/miller__rabin_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d72/modular__division_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
<tr id="row_14_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d6d/modular__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
<tr id="row_14_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
<tr id="row_14_40_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d2d/modular__inverse__simple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html" target="_self">modular_inverse_simple.cpp</a></td><td class="desc">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> </td></tr>
<tr id="row_14_41_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d27/n__bonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
<tr id="row_14_42_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dbb/n__choose__r_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
<tr id="row_14_43_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dab/ncr__modulo__p_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
<tr id="row_14_44_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/da2/number__of__positive__divisors_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
<tr id="row_14_45_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dfe/perimeter_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/dfe/perimeter_8cpp.html" target="_self">perimeter.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes </td></tr>
<tr id="row_14_46_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/def/power__for__huge__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
<tr id="row_14_47_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d38/power__of__two_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
<tr id="row_14_48_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d0d/prime__factorization_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
<tr id="row_14_49_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d9b/prime__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
<tr id="row_14_50_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9c/primes__up__to__billion_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
<tr id="row_14_51_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d18/quadratic__equations__complex__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html" target="_self">quadratic_equations_complex_numbers.cpp</a></td><td class="desc">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac &lt; 0 </td></tr>
<tr id="row_14_52_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d08/realtime__stats_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_14_53_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/ddf/sieve__of__eratosthenes_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Prime Numbers using <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> </td></tr>
<tr id="row_14_54_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d24/sqrt__double_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log
N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding </td></tr>
<tr id="row_14_55_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d47/string__fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
<tr id="row_14_56_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9d/sum__of__binomial__coefficient_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
<tr id="row_14_57_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d83/sum__of__digits_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
<tr id="row_14_58_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d66/vector__cross__product_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
<tr id="row_14_59_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d39/volume_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
<tr id="row_15_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="dynsection.toggleFolder('15_')"><span class="arrowhead closed"></span></span><span id="img_15_" class="iconfolder" onclick="dynsection.toggleFolder('15_')"><div class="folder-icon"></div></span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d9c/babylonian__method_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d9c/babylonian__method_8cpp.html" target="_self">babylonian_method.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root </td></tr>
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d6a/bisection__method_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d6a/bisection__method_8cpp.html" target="_self">bisection_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> </td></tr>
<tr id="row_15_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d01/brent__method__extrema_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d01/brent__method__extrema_8cpp.html" target="_self">brent_method_extrema.cpp</a></td><td class="desc">Find real extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Brent%27s_method" target="_blank">Brent's method</a> </td></tr>
<tr id="row_15_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d18/composite__simpson__rule_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d18/composite__simpson__rule_8cpp.html" target="_self">composite_simpson_rule.cpp</a></td><td class="desc">Implementation of the Composite Simpson Rule for the approximation </td></tr>
<tr id="row_15_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/df2/durand__kerner__roots_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/df2/durand__kerner__roots_8cpp.html" target="_self">durand_kerner_roots.cpp</a></td><td class="desc">Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method" target="_blank">Durand Kerner algorithm</a> </td></tr>
<tr id="row_15_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d29/false__position_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/d29/false__position_8cpp.html" target="_self">false_position.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Regula_falsi" target="_blank">false position method</a>, also known as the Secant method </td></tr>
<tr id="row_15_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d9a/fast__fourier__transform_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d9a/fast__fourier__transform_8cpp.html" target="_self">fast_fourier_transform.cpp</a></td><td class="desc"><a href="https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f" target="_blank">A fast Fourier transform (FFT)</a> is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT) </td></tr>
<tr id="row_15_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/de2/gaussian__elimination_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/de2/gaussian__elimination_8cpp.html" target="_self">gaussian_elimination.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gaussian_elimination" target="_blank">Gaussian elimination method</a> </td></tr>
<tr id="row_15_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d7a/golden__search__extrema_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d7a/golden__search__extrema_8cpp.html" target="_self">golden_search_extrema.cpp</a></td><td class="desc">Find extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Golden-section_search" target="_blank">golden section search algorithm</a> </td></tr>
<tr id="row_15_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d33/gram__schmidt_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d33/gram__schmidt_8cpp.html" target="_self">gram_schmidt.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process" target="_blank">Gram Schmidt Orthogonalisation Process</a> </td></tr>
<tr id="row_15_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d37/inverse__fast__fourier__transform_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d37/inverse__fast__fourier__transform_8cpp.html" target="_self">inverse_fast_fourier_transform.cpp</a></td><td class="desc"><a href="https://www.geeksforgeeks.org/python-inverse-fast-fourier-transformation/" target="_blank">An inverse fast Fourier transform (IFFT)</a> is an algorithm that computes the inverse fourier transform </td></tr>
<tr id="row_15_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d65/lu__decompose_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/d65/lu__decompose_8cpp.html" target="_self">lu_decompose.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/LU_decompositon" target="_blank">LU decomposition</a> of a square matrix </td></tr>
<tr id="row_15_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dbe/lu__decomposition_8h_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/dbe/lu__decomposition_8h.html" target="_self">lu_decomposition.h</a></td><td class="desc">Functions associated with <a href="https://en.wikipedia.org/wiki/LU_decomposition" target="_blank">LU Decomposition</a> of a square matrix </td></tr>
<tr id="row_15_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d11/midpoint__integral__method_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d11/midpoint__integral__method_8cpp.html" target="_self">midpoint_integral_method.cpp</a></td><td class="desc">A numerical method for easy <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">approximation of integrals</a> </td></tr>
<tr id="row_15_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dd3/newton__raphson__method_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dd3/newton__raphson__method_8cpp.html" target="_self">newton_raphson_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Newton%27s_method" target="_blank">Newton-Raphson method</a> for both real and complex solutions </td></tr>
<tr id="row_15_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dd3/ode__forward__euler_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/dd3/ode__forward__euler_8cpp.html" target="_self">ode_forward_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method" target="_blank">forward Euler method</a> </td></tr>
<tr id="row_15_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/dd3/ode__midpoint__euler_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html" target="_self">ode_midpoint_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">midpoint Euler method</a> </td></tr>
<tr id="row_15_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d06/ode__semi__implicit__euler_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html" target="_self">ode_semi_implicit_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method" target="_blank">semi implicit Euler method</a> </td></tr>
<tr id="row_15_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d68/qr__decompose_8h_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d68/qr__decompose_8h.html" target="_self">qr_decompose.h</a></td><td class="desc">Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
<tr id="row_15_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d24/qr__decomposition_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d24/qr__decomposition_8cpp.html" target="_self">qr_decomposition.cpp</a></td><td class="desc">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
<tr id="row_15_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d75/qr__eigen__values_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d75/qr__eigen__values_8cpp.html" target="_self">qr_eigen_values.cpp</a></td><td class="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method </td></tr>
<tr id="row_15_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/da6/rungekutta_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/da6/rungekutta_8cpp.html" target="_self">rungekutta.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method implementation </td></tr>
<tr id="row_15_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/dc8/successive__approximation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/dc8/successive__approximation_8cpp.html" target="_self">successive_approximation.cpp</a></td><td class="desc">Method of successive approximations using <a href="https://en.wikipedia.org/wiki/Fixed-point_iteration" target="_blank">fixed-point iteration</a> method </td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="dynsection.toggleFolder('16_')"><span class="arrowhead closed"></span></span><span id="img_16_" class="iconfolder" onclick="dynsection.toggleFolder('16_')"><div class="folder-icon"></div></span><a class="el" href="dir_35422be6552f1b3672c1b6c4aba2da64.html" target="_self">operations_on_datastructures</a></td><td class="desc"></td></tr>
<tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d14/array__left__rotation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d14/array__left__rotation_8cpp.html" target="_self">array_left_rotation.cpp</a></td><td class="desc">Implementation for the <a href="https://www.javatpoint.com/program-to-left-rotate-the-elements-of-an-array" target="_blank">Array Left Rotation</a> algorithm </td></tr>
<tr id="row_16_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d57/array__right__rotation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d57/array__right__rotation_8cpp.html" target="_self">array_right_rotation.cpp</a></td><td class="desc">Implementation for the <a href="https://www.javatpoint.com/program-to-right-rotate-the-elements-of-an-array" target="_blank">Array right Rotation</a> algorithm </td></tr>
<tr id="row_16_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d33/circular__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d33/circular__linked__list_8cpp.html" target="_self">circular_linked_list.cpp</a></td><td class="desc">Implementation for a <a href="https://www.geeksforgeeks.org/circular-linked-list/" target="_blank">Circular Linked List</a> </td></tr>
<tr id="row_16_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dfb/circular__queue__using__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>circular_queue_using_array.cpp</b></td><td class="desc"></td></tr>
<tr id="row_16_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/dab/get__size__of__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>get_size_of_linked_list.cpp</b></td><td class="desc"></td></tr>
<tr id="row_16_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d32/inorder__successor__of__bst_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html" target="_self">inorder_successor_of_bst.cpp</a></td><td class="desc">An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal </td></tr>
<tr id="row_16_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dc5/intersection__of__two__arrays_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dc5/intersection__of__two__arrays_8cpp.html" target="_self">intersection_of_two_arrays.cpp</a></td><td class="desc">Implementation for the <a href="https://en.wikipedia.org/wiki/Intersection_(set_theory)" target="_blank">Intersection of two sorted Arrays</a> algorithm </td></tr>
<tr id="row_16_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>reverse_a_linked_list_using_recusion.cpp</b></td><td class="desc"></td></tr>
<tr id="row_16_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/db6/reverse__binary__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/db6/reverse__binary__tree_8cpp.html" target="_self">reverse_binary_tree.cpp</a></td><td class="desc">Implementation for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reversing a Binary Tree</a> recursively algorithm </td></tr>
<tr id="row_16_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dcc/selectionsortlinkedlist_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>selectionsortlinkedlist.cpp</b></td><td class="desc"></td></tr>
<tr id="row_16_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/def/trie__multiple__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/def/trie__multiple__search_8cpp.html" target="_self">trie_multiple_search.cpp</a></td><td class="desc"><a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> with search variants </td></tr>
<tr id="row_16_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d9c/union__of__two__arrays_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d9c/union__of__two__arrays_8cpp.html" target="_self">union_of_two_arrays.cpp</a></td><td class="desc">Implementation for the <a href="https://en.wikipedia.org/wiki/Union_(set_theory)" target="_blank">Union of two sorted Arrays</a> algorithm </td></tr>
<tr id="row_17_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_17_" class="arrow" onclick="dynsection.toggleFolder('17_')"><span class="arrowhead closed"></span></span><span id="img_17_" class="iconfolder" onclick="dynsection.toggleFolder('17_')"><div class="folder-icon"></div></span><a class="el" href="dir_9510827d0b234b3cc54b29892f217477.html" target="_self">others</a></td><td class="desc"></td></tr>
<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d76/buzz__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d76/buzz__number_8cpp.html" target="_self">buzz_number.cpp</a></td><td class="desc">A buzz number is a number that is either divisible by 7 or has last digit as 7 </td></tr>
<tr id="row_17_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d06/decimal__to__binary_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d06/decimal__to__binary_8cpp.html" target="_self">decimal_to_binary.cpp</a></td><td class="desc">Function to convert decimal number to binary representation </td></tr>
<tr id="row_17_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/de7/decimal__to__hexadecimal_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html" target="_self">decimal_to_hexadecimal.cpp</a></td><td class="desc">Convert decimal number to hexadecimal representation </td></tr>
<tr id="row_17_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d85/decimal__to__roman__numeral_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html" target="_self">decimal_to_roman_numeral.cpp</a></td><td class="desc">This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral </td></tr>
<tr id="row_17_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d4e/easter_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>easter.cpp</b></td><td class="desc"></td></tr>
<tr id="row_17_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/df0/fast__integer__input_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/df0/fast__integer__input_8cpp.html" target="_self">fast_integer_input.cpp</a></td><td class="desc">Read integers from stdin continuously as they are entered without waiting for the <span class="tt">\n</span> character </td></tr>
<tr id="row_17_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/df3/happy__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/df3/happy__number_8cpp.html" target="_self">happy_number.cpp</a></td><td class="desc">A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1 </td></tr>
<tr id="row_17_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d90/iterative__tree__traversals_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d90/iterative__tree__traversals_8cpp.html" target="_self">iterative_tree_traversals.cpp</a></td><td class="desc">Iterative version of Preorder, Postorder, and preorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) </td></tr>
<tr id="row_17_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dcd/kadanes3_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dcd/kadanes3_8cpp.html" target="_self">kadanes3.cpp</a></td><td class="desc">Efficient implementation for maximum contiguous subarray sum by <a href="https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/" target="_blank">Kadane's algorithm</a> </td></tr>
<tr id="row_17_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d6b/kelvin__to__celsius_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html" target="_self">kelvin_to_celsius.cpp</a></td><td class="desc">Conversion from <a href="https://byjus.com/chemistry/kelvin-to-celsius/" target="_blank">Kelvin to Celsius</a> degrees </td></tr>
<tr id="row_17_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d65/lfu__cache_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d65/lfu__cache_8cpp.html" target="_self">lfu_cache.cpp</a></td><td class="desc">Implementation for [LFU Cache] (<a href="https://en.wikipedia.org/wiki/Least_frequently_used">https://en.wikipedia.org/wiki/Least_frequently_used</a>) </td></tr>
<tr id="row_17_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/db8/longest__substring__without__repeating__characters_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/db8/longest__substring__without__repeating__characters_8cpp.html" target="_self">longest_substring_without_repeating_characters.cpp</a></td><td class="desc"><a class="el" href="dd/d4f/class_solution.html">Solution</a> for Longest Substring Without Repeating Characters problem </td></tr>
<tr id="row_17_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/db3/lru__cache_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/db3/lru__cache_8cpp.html" target="_self">lru_cache.cpp</a></td><td class="desc">An implementation of <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU Cache</a>. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies) </td></tr>
<tr id="row_17_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/daa/lru__cache2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/daa/lru__cache2_8cpp.html" target="_self">lru_cache2.cpp</a></td><td class="desc">Implementation for [LRU Cache] (<a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)">https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)</a>) </td></tr>
<tr id="row_17_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d35/matrix__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d35/matrix__exponentiation_8cpp.html" target="_self">matrix_exponentiation.cpp</a></td><td class="desc">Matrix Exponentiation </td></tr>
<tr id="row_17_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d9a/palindrome__of__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d9a/palindrome__of__number_8cpp.html" target="_self">palindrome_of_number.cpp</a></td><td class="desc">Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome</a> or not </td></tr>
<tr id="row_17_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/dc5/paranthesis__matching_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/dc5/paranthesis__matching_8cpp.html" target="_self">paranthesis_matching.cpp</a></td><td class="desc">Perform paranthesis matching </td></tr>
<tr id="row_17_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d1a/pascal__triangle_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d1a/pascal__triangle_8cpp.html" target="_self">pascal_triangle.cpp</a></td><td class="desc">Pascal's triangle implementation </td></tr>
<tr id="row_17_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d75/postfix__evaluation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d75/postfix__evaluation_8cpp.html" target="_self">postfix_evaluation.cpp</a></td><td class="desc">Evaluation of <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation" target="_blank">Postfix Expression</a> </td></tr>
<tr id="row_17_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d7b/primality__test_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d7b/primality__test_8cpp.html" target="_self">primality_test.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Primality test</a> implementation </td></tr>
<tr id="row_17_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/de1/recursive__tree__traversal_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html" target="_self">recursive_tree_traversal.cpp</a></td><td class="desc">Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) </td></tr>
<tr id="row_17_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d01/smallest__circle_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d01/smallest__circle_8cpp.html" target="_self">smallest_circle.cpp</a></td><td class="desc">Get centre and radius of the <a href="https://en.wikipedia.org/wiki/Smallest-circle_problem" target="_blank">smallest circle</a> that circumscribes given set of points </td></tr>
<tr id="row_17_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d19/sparse__matrix_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d19/sparse__matrix_8cpp.html" target="_self">sparse_matrix.cpp</a></td><td class="desc"></td></tr>
<tr id="row_17_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d07/spiral__print_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d07/spiral__print_8cpp.html" target="_self">spiral_print.cpp</a></td><td class="desc">Print the elements of a matrix traversing it spirally </td></tr>
<tr id="row_17_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/def/stairs__pattern_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/def/stairs__pattern_8cpp.html" target="_self">stairs_pattern.cpp</a></td><td class="desc">This program is use to print the following pattern </td></tr>
<tr id="row_17_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d3c/tower__of__hanoi_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d3c/tower__of__hanoi_8cpp.html" target="_self">tower_of_hanoi.cpp</a></td><td class="desc">Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem </td></tr>
<tr id="row_17_26_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d61/vector__important__functions_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d61/vector__important__functions_8cpp.html" target="_self">vector_important_functions.cpp</a></td><td class="desc">A C++ program to demonstrate working of std::sort(), std::reverse() </td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_18_" class="arrow" onclick="dynsection.toggleFolder('18_')"><span class="arrowhead closed"></span></span><span id="img_18_" class="iconfolder" onclick="dynsection.toggleFolder('18_')"><div class="folder-icon"></div></span><a class="el" href="dir_59dc24c326e2a72d1164f014b22de83d.html" target="_self">physics</a></td><td class="desc"></td></tr>
<tr id="row_18_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d29/ground__to__ground__projectile__motion_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d29/ground__to__ground__projectile__motion_8cpp.html" target="_self">ground_to_ground_projectile_motion.cpp</a></td><td class="desc">Ground to ground <a href="https://en.wikipedia.org/wiki/Projectile_motion" target="_blank">projectile motion</a> equation implementations </td></tr>
<tr id="row_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_19_" class="arrow" onclick="dynsection.toggleFolder('19_')"><span class="arrowhead closed"></span></span><span id="img_19_" class="iconfolder" onclick="dynsection.toggleFolder('19_')"><div class="folder-icon"></div></span><a class="el" href="dir_82e494173a87936756866de2fa774307.html" target="_self">probability</a></td><td class="desc"></td></tr>
<tr id="row_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d4a/addition__rule_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d4a/addition__rule_8cpp.html" target="_self">addition_rule.cpp</a></td><td class="desc">Addition rule of probabilities </td></tr>
<tr id="row_19_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d67/bayes__theorem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d67/bayes__theorem_8cpp.html" target="_self">bayes_theorem.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bayes%27_theorem" target="_blank">Bayes' theorem</a> </td></tr>
<tr id="row_19_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/db0/binomial__dist_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/db0/binomial__dist_8cpp.html" target="_self">binomial_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Binomial_distribution" target="_blank">Binomial distribution</a> example </td></tr>
<tr id="row_19_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/da2/exponential__dist_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/da2/exponential__dist_8cpp.html" target="_self">exponential_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Exponential_distribution" target="_blank">Exponential Distribution</a> </td></tr>
<tr id="row_19_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d72/geometric__dist_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d72/geometric__dist_8cpp.html" target="_self">geometric_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Geometric_distribution" target="_blank">Geometric Distribution</a> </td></tr>
<tr id="row_19_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d24/poisson__dist_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d24/poisson__dist_8cpp.html" target="_self">poisson_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Poisson_distribution" target="_blank">Poisson statistics</a> </td></tr>
<tr id="row_19_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/ded/windowed__median_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/ded/windowed__median_8cpp.html" target="_self">windowed_median.cpp</a></td><td class="desc">An implementation of a median calculation of a sliding window along a data stream </td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_20_" class="arrow" onclick="dynsection.toggleFolder('20_')"><span class="arrowhead closed"></span></span><span id="img_20_" class="iconfolder" onclick="dynsection.toggleFolder('20_')"><div class="folder-icon"></div></span><a class="el" href="dir_074119ce3a874b57120c49a0cc4bb5ad.html" target="_self">range_queries</a></td><td class="desc"></td></tr>
<tr id="row_20_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d2e/fenwick__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d2e/fenwick__tree_8cpp.html" target="_self">fenwick_tree.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Fenwick_tree" target="_blank">Fenwick Tree</a> algorithm implementation </td></tr>
<tr id="row_20_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/de9/heavy__light__decomposition_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/de9/heavy__light__decomposition_8cpp.html" target="_self">heavy_light_decomposition.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heavy_path_decomposition" target="_blank">Heavy Light Decomposition</a> implementation </td></tr>
<tr id="row_20_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d53/mo_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>mo.cpp</b></td><td class="desc"></td></tr>
<tr id="row_20_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html" target="_self">persistent_seg_tree_lazy_prop.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Persistent_data_structure" target="_blank">Persistent segment tree with range updates (lazy propagation)</a> </td></tr>
<tr id="row_20_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d9e/prefix__sum__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d9e/prefix__sum__array_8cpp.html" target="_self">prefix_sum_array.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Prefix_sum" target="_blank">Prefix Sum Array</a> data structure implementation </td></tr>
<tr id="row_20_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d45/segtree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d45/segtree_8cpp.html" target="_self">segtree.cpp</a></td><td class="desc">Implementation of [Segment Tree] (<a href="https://en.wikipedia.org/wiki/Segment_tree">https://en.wikipedia.org/wiki/Segment_tree</a>) data structure </td></tr>
<tr id="row_20_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d96/sparse__table__range__queries_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>sparse_table_range_queries.cpp</b></td><td class="desc"></td></tr>
<tr id="row_21_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_21_" class="arrow" onclick="dynsection.toggleFolder('21_')"><span class="arrowhead closed"></span></span><span id="img_21_" class="iconfolder" onclick="dynsection.toggleFolder('21_')"><div class="folder-icon"></div></span><a class="el" href="dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html" target="_self">scripts</a></td><td class="desc"></td></tr>
<tr id="row_21_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d02/file__linter_8py_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>file_linter.py</b></td><td class="desc"></td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_22_" class="arrow" onclick="dynsection.toggleFolder('22_')"><span class="arrowhead closed"></span></span><span id="img_22_" class="iconfolder" onclick="dynsection.toggleFolder('22_')"><div class="folder-icon"></div></span><a class="el" href="dir_19b2bf9199a15c634a08b1ede1dd896a.html" target="_self">search</a></td><td class="desc"></td></tr>
<tr id="row_22_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/dd5/binary__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>binary_search.cpp</b></td><td class="desc"></td></tr>
<tr id="row_22_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d8a/exponential__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d8a/exponential__search_8cpp.html" target="_self">exponential_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a> </td></tr>
<tr id="row_22_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d0d/fibonacci__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d0d/fibonacci__search_8cpp.html" target="_self">fibonacci_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Fibonacci_search_technique" target="_blank">Fibonacci search algorithm</a> </td></tr>
<tr id="row_22_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dc4/floyd__cycle__detection__algo_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/dc4/floyd__cycle__detection__algo_8cpp.html" target="_self">floyd_cycle_detection_algo.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm </td></tr>
<tr id="row_22_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/df3/hash__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/df3/hash__search_8cpp.html" target="_self">hash_search.cpp</a></td><td class="desc">Hash Search Algorithm - Best Time Complexity Ω(1) </td></tr>
<tr id="row_22_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dd7/interpolation__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>interpolation_search.cpp</b></td><td class="desc"></td></tr>
<tr id="row_22_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d39/interpolation__search2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d39/interpolation__search2_8cpp.html" target="_self">interpolation_search2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Interpolation_search" target="_blank">Interpolation search</a> algorithm </td></tr>
<tr id="row_22_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d22/jump__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d22/jump__search_8cpp.html" target="_self">jump_search.cpp</a></td><td class="desc">C++ program to implement <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">Jump Search</a> </td></tr>
<tr id="row_22_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d02/linear__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d02/linear__search_8cpp.html" target="_self">linear_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Linear_search" target="_blank">Linear search algorithm</a> </td></tr>
<tr id="row_22_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html" target="_self">longest_increasing_subsequence_using_binary_search.cpp</a></td><td class="desc">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> </td></tr>
<tr id="row_22_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d69/median__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d69/median__search_8cpp.html" target="_self">median_search.cpp</a></td><td class="desc">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> </td></tr>
<tr id="row_22_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dfa/median__search2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/dfa/median__search2_8cpp.html" target="_self">median_search2.cpp</a></td><td class="desc">Given a linked list L[0,....,n] of n numbers, find the middle node </td></tr>
<tr id="row_22_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d22/saddleback__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d22/saddleback__search_8cpp.html" target="_self">saddleback_search.cpp</a></td><td class="desc">Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays </td></tr>
<tr id="row_22_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d45/sublist__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d45/sublist__search_8cpp.html" target="_self">sublist_search.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> </td></tr>
<tr id="row_22_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/dfe/ternary__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/dfe/ternary__search_8cpp.html" target="_self">ternary_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Ternary_search" target="_blank">Ternary search</a> algorithm </td></tr>
<tr id="row_22_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/db5/text__search_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/db5/text__search_8cpp.html" target="_self">text_search.cpp</a></td><td class="desc">Search for words in a long textual paragraph </td></tr>
<tr id="row_23_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_23_" class="arrow" onclick="dynsection.toggleFolder('23_')"><span class="arrowhead closed"></span></span><span id="img_23_" class="iconfolder" onclick="dynsection.toggleFolder('23_')"><div class="folder-icon"></div></span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></td></tr>
<tr id="row_23_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d25/bead__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>bead_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dcc/binary__insertion__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/dcc/binary__insertion__sort_8cpp.html" target="_self">binary_insertion_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Binary Insertion Sort Algorithm (Insertion Sort)</a> </td></tr>
<tr id="row_23_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d8f/bitonic__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>bitonic_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/ddb/bogo__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/ddb/bogo__sort_8cpp.html" target="_self">bogo_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort" target="_blank">Bogosort algorithm</a> </td></tr>
<tr id="row_23_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d13/bubble__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d13/bubble__sort_8cpp.html" target="_self">bubble_sort.cpp</a></td><td class="desc">Bubble sort algorithm </td></tr>
<tr id="row_23_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dc1/bucket__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>bucket_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dd2/cocktail__selection__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>cocktail_selection_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dfd/comb__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/dfd/comb__sort_8cpp.html" target="_self">comb_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Comb_sort" target="_blank">Comb Sort Algorithm (Comb Sort)</a> </td></tr>
<tr id="row_23_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d26/count__inversions_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d26/count__inversions_8cpp.html" target="_self">count_inversions.cpp</a></td><td class="desc">Counting Inversions using <a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merge Sort</a> </td></tr>
<tr id="row_23_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d40/counting__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>counting_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/db2/counting__sort__string_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>counting_sort_string.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d07/cycle__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d07/cycle__sort_8cpp.html" target="_self">cycle_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_sort" target="_blank">Cycle sort</a> algorithm </td></tr>
<tr id="row_23_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d1a/dnf__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d1a/dnf__sort_8cpp.html" target="_self">dnf_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/" target="_blank">DNF sort</a> implementation </td></tr>
<tr id="row_23_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d21/gnome__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d21/gnome__sort_8cpp.html" target="_self">gnome_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gnome_sort" target="_blank">gnome sort</a> algorithm </td></tr>
<tr id="row_23_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d52/heap__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d52/heap__sort_8cpp.html" target="_self">heap_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heapsort" target="_blank">Heap Sort Algorithm (heap sort)</a> implementation </td></tr>
<tr id="row_23_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d0d/insertion__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/d0d/insertion__sort_8cpp.html" target="_self">insertion_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion Sort Algorithm (Insertion Sort)</a> </td></tr>
<tr id="row_23_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d89/insertion__sort__recursive_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/d89/insertion__sort__recursive_8cpp.html" target="_self">insertion_sort_recursive.cpp</a></td><td class="desc">Insertion Sort Algorithm </td></tr>
<tr id="row_23_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d74/library__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>library_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d7b/merge__insertion__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d7b/merge__insertion__sort_8cpp.html" target="_self">merge_insertion_sort.cpp</a></td><td class="desc">Algorithm that combines insertion sort and merge sort. <a href="https://en.wikipedia.org/wiki/Merge-insertion_sort" target="_blank">Wiki link</a> </td></tr>
<tr id="row_23_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/df4/merge__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/df4/merge__sort_8cpp.html" target="_self">merge_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merge Sort Algorithm (MERGE SORT)</a> implementation </td></tr>
<tr id="row_23_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/db6/non__recursive__merge__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/db6/non__recursive__merge__sort_8cpp.html" target="_self">non_recursive_merge_sort.cpp</a></td><td class="desc"></td></tr>
<tr id="row_23_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/de3/numeric__string__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>numeric_string_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/da9/odd__even__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>odd_even_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d92/pancake__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d92/pancake__sort_8cpp.html" target="_self">pancake_sort.cpp</a></td><td class="desc">Pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips </td></tr>
<tr id="row_23_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/da8/pigeonhole__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dd/da8/pigeonhole__sort_8cpp.html" target="_self">pigeonhole_sort.cpp</a></td><td class="desc">Implementation of [Pigeonhole Sort algorithm] (<a href="https://en.wikipedia.org/wiki/Pigeonhole_sort">https://en.wikipedia.org/wiki/Pigeonhole_sort</a>) </td></tr>
<tr id="row_23_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d21/quick__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d21/quick__sort_8cpp.html" target="_self">quick_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++ </td></tr>
<tr id="row_23_26_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d4c/quick__sort__3_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d4c/quick__sort__3_8cpp.html" target="_self">quick_sort_3.cpp</a></td><td class="desc">Implementation Details </td></tr>
<tr id="row_23_27_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d22/quick__sort__iterative_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d22/quick__sort__iterative_8cpp.html" target="_self">quick_sort_iterative.cpp</a></td><td class="desc">Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case </td></tr>
<tr id="row_23_28_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d7c/radix__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>radix_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_29_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d61/radix__sort2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d61/radix__sort2_8cpp.html" target="_self">radix_sort2.cpp</a></td><td class="desc">Algorithm of <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> </td></tr>
<tr id="row_23_30_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/daa/random__pivot__quick__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/daa/random__pivot__quick__sort_8cpp.html" target="_self">random_pivot_quick_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> algorithm </td></tr>
<tr id="row_23_31_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/df9/recursive__bubble__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/df9/recursive__bubble__sort_8cpp.html" target="_self">recursive_bubble_sort.cpp</a></td><td class="desc">This is an implementation of a recursive version of the <a href="https://www.geeksforgeeks.org/recursive-bubble-sort/" target="_blank">Bubble sort algorithm</a> </td></tr>
<tr id="row_23_32_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d85/selection__sort__iterative_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>selection_sort_iterative.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_33_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9f/selection__sort__recursive_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9f/selection__sort__recursive_8cpp.html" target="_self">selection_sort_recursive.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion </td></tr>
<tr id="row_23_34_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d40/shell__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>shell_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_35_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d7a/shell__sort2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d7a/shell__sort2_8cpp.html" target="_self">shell_sort2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm </td></tr>
<tr id="row_23_36_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/db5/slow__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>slow_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_37_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d4f/stooge__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d4f/stooge__sort_8cpp.html" target="_self">stooge_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Stooge_sort" target="_blank">Stooge sort implementation</a> in C++ </td></tr>
<tr id="row_23_38_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/dd9/strand__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/dd9/strand__sort_8cpp.html" target="_self">strand_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
<tr id="row_23_39_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/dd5/swap__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>swap_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_40_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d1e/tim__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>tim_sort.cpp</b></td><td class="desc"></td></tr>
<tr id="row_23_41_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d3f/wave__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d3f/wave__sort_8cpp.html" target="_self">wave_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm </td></tr>
<tr id="row_23_42_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dcc/wiggle__sort_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/dcc/wiggle__sort_8cpp.html" target="_self">wiggle_sort.cpp</a></td><td class="desc">[Wiggle Sort Algorithm] (<a href="https://leetcode.com/problems/wiggle-sort-ii/">https://leetcode.com/problems/wiggle-sort-ii/</a>) Implementation </td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_24_" class="arrow" onclick="dynsection.toggleFolder('24_')"><span class="arrowhead closed"></span></span><span id="img_24_" class="iconfolder" onclick="dynsection.toggleFolder('24_')"><div class="folder-icon"></div></span><a class="el" href="dir_73a3cc5065b223eb41b02873c0e19f0e.html" target="_self">strings</a></td><td class="desc"></td></tr>
<tr id="row_24_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/db2/boyer__moore_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/db2/boyer__moore_8cpp.html" target="_self">boyer_moore.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible </td></tr>
<tr id="row_24_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d7d/brute__force__string__searching_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html" target="_self">brute_force_string_searching.cpp</a></td><td class="desc">String pattern search - brute force </td></tr>
<tr id="row_24_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d09/duval_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d09/duval_8cpp.html" target="_self">duval.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Lyndon_word" target="_blank">Duval's algorithm</a> </td></tr>
<tr id="row_24_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dfe/horspool_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/dfe/horspool_8cpp.html" target="_self">horspool.cpp</a></td><td class="desc">Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) </td></tr>
<tr id="row_24_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d6a/knuth__morris__pratt_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html" target="_self">knuth_morris_pratt.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm" target="_blank">Knuth-Morris-Pratt Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
<tr id="row_24_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d39/manacher__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d39/manacher__algorithm_8cpp.html" target="_self">manacher_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> </td></tr>
<tr id="row_24_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/dce/rabin__karp_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/dce/rabin__karp_8cpp.html" target="_self">rabin_karp.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Rabin–Karp_algorithm" target="_blank">Rabin-Karp Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
<tr id="row_24_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d80/z__function_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/d80/z__function_8cpp.html" target="_self">z_function.cpp</a></td><td class="desc">The <a href="https://cp-algorithms.com/string/z-function.html" target="_blank">Z function</a> for finding occurences of a pattern within a piece of text with time and space complexity O(n + m) </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->
</div><!-- doc-content -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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