Files
C-Plus-Plus/namespaces.html
2026-10-03 10:34:41 +00:00

310 lines
60 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.18.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: Namespace 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.18.0 -->
<script type="text/javascript">
let searchBox = new SearchBox("searchBox", "search/",'.html');
</script>
<script type="text/javascript">
document.addEventListener('DOMContentLoaded', codefold.init);
</script>
<script type="application/json" id="doxygen-config">
{
"relPath": "",
"generateTreeView": true,
"searchEngine": true,
"serverBasedSearch": false,
"disableIndex": false,
"dynamicMenus": true,
"fullSidebar": false
}
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<div id="main-nav-mobile">
<div class="sm sm-dox"><input id="main-menu-state" type="checkbox"/>
<label class="main-menu-btn" for="main-menu-state">
<span class="main-menu-btn-icon"></span> Toggle main menu visibility</label>
<span id="searchBoxPos1"></span>
</div>
</div><!-- main-nav-mobile -->
<div id="main-nav">
<ul class="sm sm-dox" id="main-menu">
<li id="searchBoxPos2">
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<span id="MSearchSelect" class="search-icon"><span class="search-icon-dropdown"></span></span>
<input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><div id="MSearchCloseImg" class="close-icon"></div></a>
</span>
</div>
</li>
</ul>
</div><!-- main-nav -->
</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" class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
document.addEventListener('DOMContentLoaded',() => { initNavTree('namespaces.html','',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow">
</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">Namespace List</div></div>
</div><!--header-->
<div class="contents">
<div class="textblock">Here is a list of all documented namespaces with brief descriptions:</div><div class="directory">
<table class="directory">
<tr id="row_0_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d2a/namespacea1z26.html" target="_self">a1z26</a></td><td class="desc">Functions for <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26</a> encryption and decryption implementation </td></tr>
<tr id="row_1_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/df8/namespaceabbreviation.html" target="_self">abbreviation</a></td><td class="desc">Functions for <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbreviation</a> implementation </td></tr>
<tr id="row_2_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d39/namespaceactivations.html" target="_self">activations</a></td><td class="desc">Various activation functions used in Neural network </td></tr>
<tr id="row_3_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/db3/namespaceatbash.html" target="_self">atbash</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Atbash" target="_blank">Atbash Cipher</a> implementation </td></tr>
<tr id="row_4_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/ddc/namespaceaystar__search.html" target="_self">aystar_search</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* Search</a> implementation </td></tr>
<tr id="row_5_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/dc0/namespacebacktracking.html" target="_self">backtracking</a></td><td class="desc">For vector container </td></tr>
<tr id="row_6_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dc9/namespacebase64__encoding.html" target="_self">base64_encoding</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Base64" target="_blank">Base64 Encoding and Decoding</a> implementation </td></tr>
<tr id="row_7_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d13/namespacebidirectional__dijkstra.html" target="_self">bidirectional_dijkstra</a></td><td class="desc">Functions for [Bidirectional Dijkstra Shortest Path] (<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>) algorithm </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d7a/namespacebinomial.html" target="_self">binomial</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> implementation </td></tr>
<tr id="row_9_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d81/namespacebit__manipulation.html" target="_self">bit_manipulation</a></td><td class="desc">For std::string </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d64/namespaceboruvkas__minimum__spanning__tree.html" target="_self">boruvkas_minimum_spanning_tree</a></td><td class="desc">Functions for the [Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) implementation </td></tr>
<tr id="row_11_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/dd5/namespacebubble__sort.html" target="_self">bubble_sort</a></td><td class="desc">Bubble sort algorithm </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d81/namespacecaesar.html" target="_self">caesar</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Caesar_cipher" target="_blank">Caesar cipher</a> algorithm </td></tr>
<tr id="row_13_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d4e/namespaceciphers.html" target="_self">ciphers</a></td><td class="desc">Algorithms for encryption and decryption </td></tr>
<tr id="row_13_0_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html" target="_self">elliptic_curve_key_exchange</a></td><td class="desc">Namespace <a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html" title="namespace elliptic_curve_key_exchange">elliptic_curve_key_exchange</a> </td></tr>
<tr id="row_14_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dcd/namespacecircular__linked__list.html" target="_self">circular_linked_list</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/circular-linked-list/" target="_blank">Circular Linked List</a> implementation </td></tr>
<tr id="row_15_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d4a/namespaceconditional__probability.html" target="_self">conditional_probability</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Conditional_probability" target="_blank">Conditional Probability</a> algorithm implementation </td></tr>
<tr id="row_16_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d38/namespacecount__bits__flip.html" target="_self">count_bits_flip</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/count-set-bits-in-an-integer/" target="_blank">count bits flip</a> implementation </td></tr>
<tr id="row_17_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/dae/namespacecount__of__set__bits.html" target="_self">count_of_set_bits</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/count-set-bits-in-an-integer/" target="_blank">count sets bits</a> implementation </td></tr>
<tr id="row_18_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html" target="_self">count_of_trailing_ciphers_in_factorial_n</a></td><td class="desc">Functions for the <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_19_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d36/namespacecut__rod.html" target="_self">cut_rod</a></td><td class="desc">Implementation of cutting a rod problem </td></tr>
<tr id="row_20_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d82/namespacecycle__detection.html" target="_self">cycle_detection</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm </td></tr>
<tr id="row_21_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dfb/namespacecycle__sort.html" target="_self">cycle_sort</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Cycle_sort" target="_blank">Cycle sort</a> algorithm </td></tr>
<tr id="row_22_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d3c/namespacedata__structures.html" target="_self">data_structures</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_22_0_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d2e/namespacedata__structures_1_1treap.html" target="_self">treap</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation </td></tr>
<tr id="row_23_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/da7/namespacedepth__first__search.html" target="_self">depth_first_search</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search</a> algorithm </td></tr>
<tr id="row_24_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/db4/namespacedisjoint__union.html" target="_self">disjoint_union</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> implementation </td></tr>
<tr id="row_25_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/dba/namespacedivide__and__conquer.html" target="_self">divide_and_conquer</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_26_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d75/namespacednf__sort.html" target="_self">dnf_sort</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Dutch_national_flag_problem" target="_blank">DNF sort</a> implementation </td></tr>
<tr id="row_27_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d65/namespacedouble__hashing.html" target="_self">double_hashing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double hashing</a> algorithm </td></tr>
<tr id="row_28_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d88/namespacedp.html" target="_self">dp</a></td><td class="desc">For std::vector </td></tr>
<tr id="row_29_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d24/namespacedynamic__programming.html" target="_self">dynamic_programming</a></td><td class="desc">Dynamic Programming algorithms </td></tr>
<tr id="row_30_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/dff/namespaceeven__odd.html" target="_self">even_odd</a></td><td class="desc">Functions for checking if a number is even or odd using bitwise operations </td></tr>
<tr id="row_31_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/d35/namespaceexponential__dist.html" target="_self">exponential_dist</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Exponential_distribution" target="_blank">Exponential Distribution</a> algorithm implementation </td></tr>
<tr id="row_32_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dea/namespacefalse__position.html" target="_self">false_position</a></td><td class="desc">Functions for [False Position] (<a href="https://en.wikipedia.org/wiki/Regula_falsi">https://en.wikipedia.org/wiki/Regula_falsi</a>) method </td></tr>
<tr id="row_33_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d76/namespacefibonacci.html" target="_self">fibonacci</a></td><td class="desc">Functions for Fibonacci sequence </td></tr>
<tr id="row_34_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/dc9/namespacefibonacci__sum.html" target="_self">fibonacci_sum</a></td><td class="desc">Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) +
\mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
<tr id="row_35_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/da7/namespacefind__non__repeating__integer.html" target="_self">find_non_repeating_integer</a></td><td class="desc">Functions 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_36_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d9c/namespacegames.html" target="_self">games</a></td><td class="desc">(Mini)game implementations </td></tr>
<tr id="row_36_0_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d41/namespacegames_1_1memory__game.html" target="_self">memory_game</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Matching_game" target="_blank">Memory Game</a> implementation </td></tr>
<tr id="row_37_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/ddb/namespacegcd__of__n__numbers.html" target="_self">gcd_of_n_numbers</a></td><td class="desc">Compute GCD of numbers in an array </td></tr>
<tr id="row_38_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d8a/namespacegeometric__dist.html" target="_self">geometric_dist</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Geometric_distribution" target="_blank">Geometric Distribution</a> algorithm implementation </td></tr>
<tr id="row_39_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">For std::swap </td></tr>
<tr id="row_40_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d0f/namespacegram__schmidt.html" target="_self">gram_schmidt</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process" target="_blank">Gram Schmidt Orthogonalisation Process</a> </td></tr>
<tr id="row_41_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dce/namespacegraph.html" target="_self">graph</a></td><td class="desc"><a class="el" href="dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms </td></tr>
<tr id="row_42_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d08/namespacegraph__coloring.html" target="_self">graph_coloring</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm, </td></tr>
<tr id="row_43_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d9b/namespacegray__code.html" target="_self">gray_code</a></td><td class="desc">Generate n-bit Gray code </td></tr>
<tr id="row_44_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d90/namespacegreedy__algorithms.html" target="_self">greedy_algorithms</a></td><td class="desc">For string class </td></tr>
<tr id="row_44_0_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html" target="_self">dijkstra</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
<tr id="row_44_1_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html" target="_self">stable_matching</a></td><td class="desc">Functions for the Gale-Shapley Algorithm </td></tr>
<tr id="row_45_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d20/namespaceground__to__ground__projectile__motion.html" target="_self">ground_to_ground_projectile_motion</a></td><td class="desc">Functions for the Ground to ground <a href="https://en.wikipedia.org/wiki/Projectile_motion" target="_blank">projectile motion</a> equation </td></tr>
<tr id="row_46_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d1c/namespacehamming__distance.html" target="_self">hamming_distance</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> implementation </td></tr>
<tr id="row_47_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d0c/namespacehashing.html" target="_self">hashing</a></td><td class="desc">Used for assert </td></tr>
<tr id="row_48_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/d6f/namespaceheavy__light__decomposition.html" target="_self">heavy_light_decomposition</a></td><td class="desc">Heavy light decomposition algorithm </td></tr>
<tr id="row_49_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d02/namespacehorspool.html" target="_self">horspool</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm" target="_blank">Horspool's</a> algorithm </td></tr>
<tr id="row_50_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/de1/namespacehouse__robber.html" target="_self">house_robber</a></td><td class="desc">Functions for the <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber</a> algorithm </td></tr>
<tr id="row_51_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d74/namespaceinorder__successor__of__bst.html" target="_self">inorder_successor_of_bst</a></td><td class="desc">Functions for the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> implementation </td></tr>
<tr id="row_52_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/d64/namespaceinterpolation__search.html" target="_self">interpolation_search</a></td><td class="desc">Functions for the Recursive version of Inorder, Preorder, and Postorder <a href="https://en.wikipedia.org/wiki/Tree_traversal" target="_blank">Traversal of the Tree</a> algorithm implementation </td></tr>
<tr id="row_53_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d13/namespaceinversion.html" target="_self">inversion</a></td><td class="desc">Functions for counting inversions using Merge Sort algorithm </td></tr>
<tr id="row_54_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d83/namespaceis__graph__bipartite.html" target="_self">is_graph_bipartite</a></td><td class="desc">Functions for checking whether a graph is bipartite or not </td></tr>
<tr id="row_55_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d73/namespaceiterative__tree__traversals.html" target="_self">iterative_tree_traversals</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Tree_traversal" target="_blank">Traversal of the Tree</a> algorithm </td></tr>
<tr id="row_56_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/da7/namespacejarvis.html" target="_self">jarvis</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm </td></tr>
<tr id="row_57_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d4c/namespacek__nearest__neighbors.html" target="_self">k_nearest_neighbors</a></td><td class="desc">Functions for the [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>) implementation </td></tr>
<tr id="row_58_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d74/namespacekadane.html" target="_self">kadane</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane</a> algorithm </td></tr>
<tr id="row_59_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d41/namespacekaratsuba__algorithm.html" target="_self">karatsuba_algorithm</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> implementation </td></tr>
<tr id="row_60_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/daf/namespace_knapsack.html" target="_self">Knapsack</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 </td></tr>
<tr id="row_61_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/db6/namespaceknight__tour.html" target="_self">knight_tour</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm </td></tr>
<tr id="row_62_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d2c/namespacelayers.html" target="_self">layers</a></td><td class="desc">This namespace contains layers used in MLP </td></tr>
<tr id="row_63_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d89/namespacelinear__probing.html" target="_self">linear_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing</a> algorithm </td></tr>
<tr id="row_64_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dd1/namespacelinear__recurrence__matrix.html" target="_self">linear_recurrence_matrix</a></td><td class="desc">Functions for <a href="https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/" target="_blank">Linear Recurrence Matrix</a> implementation </td></tr>
<tr id="row_65_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/db0/namespacelinked__list.html" target="_self">linked_list</a></td><td class="desc">Functions for singly linked list algorithm </td></tr>
<tr id="row_66_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d27/namespacelist__array.html" target="_self">list_array</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> algorithm </td></tr>
<tr id="row_67_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcd/namespacelru__cache.html" target="_self">lru_cache</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU caching algorithm</a> </td></tr>
<tr id="row_68_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d77/namespacemachine__learning.html" target="_self">machine_learning</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a> </td></tr>
<tr id="row_69_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d93/namespacemagic__sequence.html" target="_self">magic_sequence</a></td><td class="desc">Functions for the <a href="https://www.csplib.org/Problems/prob019/" target="_blank">Magic sequence</a> implementation </td></tr>
<tr id="row_70_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dc6/namespacemanacher.html" target="_self">manacher</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> implementation </td></tr>
<tr id="row_71_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For assert </td></tr>
<tr id="row_72_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d43/namespace_m_d5.html" target="_self">MD5</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/MD5" target="_blank">MD5</a> algorithm implementation </td></tr>
<tr id="row_73_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dd4/namespacemedian__search.html" target="_self">median_search</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Median_search" target="_blank">Median search</a> algorithm </td></tr>
<tr id="row_74_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d0a/namespacemerge__insertion.html" target="_self">merge_insertion</a></td><td class="desc">Combined Intersion-Merge sorting algorithm </td></tr>
<tr id="row_75_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/daa/namespacemidpoint__rule.html" target="_self">midpoint_rule</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">Midpoint Integral</a> method implementation </td></tr>
<tr id="row_76_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/db8/namespacemincoins__topdown.html" target="_self">mincoins_topdown</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/coin-change/" target="_blank">minimum coin exchange</a> problem </td></tr>
<tr id="row_77_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d12/namespace_minimum.html" target="_self">Minimum</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> algorithm </td></tr>
<tr id="row_78_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/d64/namespacemodular__division.html" target="_self">modular_division</a></td><td class="desc">Functions for <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> implementation </td></tr>
<tr id="row_79_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d50/namespacemodular__inverse__fermat.html" target="_self">modular_inverse_fermat</a></td><td class="desc">Calculate modular inverse using Fermat's Little Theorem </td></tr>
<tr id="row_80_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/da4/namespacemonte__carlo.html" target="_self">monte_carlo</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> implementation </td></tr>
<tr id="row_81_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d8d/namespacemorse.html" target="_self">morse</a></td><td class="desc">Functions for [Morse Code] (<a href="https://en.wikipedia.org/wiki/Morse_code">https://en.wikipedia.org/wiki/Morse_code</a>) </td></tr>
<tr id="row_82_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d36/namespacen__bonacci.html" target="_self">n_bonacci</a></td><td class="desc">Functions for the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> implementation </td></tr>
<tr id="row_83_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/da1/namespacen__queens.html" target="_self">n_queens</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle </td></tr>
<tr id="row_84_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d44/namespacen__queens__all__solutions.html" target="_self">n_queens_all_solutions</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions </td></tr>
<tr id="row_85_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d14/namespacen__queens__optimized.html" target="_self">n_queens_optimized</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized </td></tr>
<tr id="row_86_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/db9/namespacencr__modulo__p.html" target="_self">ncr_modulo_p</a></td><td class="desc">Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> implementation </td></tr>
<tr id="row_87_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d2e/namespaceneural__network.html" target="_self">neural_network</a></td><td class="desc">Neural Network or Multilayer Perceptron </td></tr>
<tr id="row_88_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/de0/namespacenumerical__methods.html" target="_self">numerical_methods</a></td><td class="desc">For assert </td></tr>
<tr id="row_89_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For std::vector </td></tr>
<tr id="row_90_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">For <span class="tt"><a class="el" href="d7/dfc/classvector.html" title="STL class.">vector</a></span> </td></tr>
<tr id="row_90_0_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/dde/namespaceothers_1_1_cache.html" target="_self">Cache</a></td><td class="desc"><a class="el" href="db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> algorithm </td></tr>
<tr id="row_91_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d89/namespacepalindrome__partitioning.html" target="_self">palindrome_partitioning</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm </td></tr>
<tr id="row_92_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d10/namespacepancake__sort.html" target="_self">pancake_sort</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Pancake_sorting" target="_blank">Pancake sort</a> algorithm </td></tr>
<tr id="row_93_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/dd0/namespacephysics.html" target="_self">physics</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_94_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/de6/namespacepostfix__expression.html" target="_self">postfix_expression</a></td><td class="desc">Functions for Postfix Expression algorithm </td></tr>
<tr id="row_95_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d88/namespaceprefix__sum__array.html" target="_self">prefix_sum_array</a></td><td class="desc">Range sum queries using prefix-sum-array </td></tr>
<tr id="row_96_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/ded/namespaceprobability.html" target="_self">probability</a></td><td class="desc">For std::string </td></tr>
<tr id="row_97_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d3b/namespaceqr__algorithm.html" target="_self">qr_algorithm</a></td><td class="desc">Functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of any rectangular matrix </td></tr>
<tr id="row_98_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing</a> algorithm </td></tr>
<tr id="row_99_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d70/namespacequeue__using__array.html" target="_self">queue_using_array</a></td><td class="desc">Functions for [<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>) implementation </td></tr>
<tr id="row_100_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d2b/namespacequick__sort.html" target="_self">quick_sort</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++ </td></tr>
<tr id="row_101_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dda/namespaceradix__sort.html" target="_self">radix_sort</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> algorithm </td></tr>
<tr id="row_102_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d6b/namespacerandom__pivot__quick__sort.html" target="_self">random_pivot_quick_sort</a></td><td class="desc">Functions for the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> implementation </td></tr>
<tr id="row_103_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">For std::vector </td></tr>
<tr id="row_104_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d60/namespacerat__maze.html" target="_self">rat_maze</a></td><td class="desc">Functions for <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_105_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/dc5/namespacereverse__binary__tree.html" target="_self">reverse_binary_tree</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reverse a Binary Tree</a> implementation </td></tr>
<tr id="row_106_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/de7/namespacerunge__kutta.html" target="_self">runge_kutta</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method </td></tr>
<tr id="row_107_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/dda/namespacesaddleback.html" target="_self">saddleback</a></td><td class="desc">Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> </td></tr>
<tr id="row_108_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">For std::assert </td></tr>
<tr id="row_109_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d4a/namespaceselection__sort__recursive.html" target="_self">selection_sort_recursive</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion </td></tr>
<tr id="row_110_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d88/namespaceset_kth_bit.html" target="_self">setKthBit</a></td><td class="desc">Functions for the [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>) implementation </td></tr>
<tr id="row_111_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/dd3/namespace_s_h_a.html" target="_self">SHA</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/SHA-1" target="_blank">SHA-1</a> algorithm implementation </td></tr>
<tr id="row_112_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/deb/namespaceshortest__common__supersequence.html" target="_self">shortest_common_supersequence</a></td><td class="desc">Shortest Common Super Sequence algorithm </td></tr>
<tr id="row_113_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/db0/namespacesieve__of__eratosthenes.html" target="_self">sieve_of_eratosthenes</a></td><td class="desc">Functions for finding Prime Numbers using Sieve of Eratosthenes </td></tr>
<tr id="row_114_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d6d/namespacesimpson__method.html" target="_self">simpson_method</a></td><td class="desc">Contains the Simpson's method implementation </td></tr>
<tr id="row_115_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d91/namespacesorting.html" target="_self">sorting</a></td><td class="desc">For working with vectors </td></tr>
<tr id="row_116_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d55/namespacesparse__table.html" target="_self">sparse_table</a></td><td class="desc">Functions for Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> </td></tr>
<tr id="row_117_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dd3/namespacespirograph.html" target="_self">spirograph</a></td><td class="desc"></td></tr>
<tr id="row_118_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d1c/namespacestack__using__queue.html" target="_self">stack_using_queue</a></td><td class="desc">Functions for the <a href="https://www.studytonight.com/data-structures/stack-using-queue" target="_blank">Stack Using Queue</a> implementation </td></tr>
<tr id="row_119_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
<tr id="row_120_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d1d/namespacestrand.html" target="_self">strand</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
<tr id="row_121_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d91/namespacestrassens__multiplication.html" target="_self">strassens_multiplication</a></td><td class="desc">Namespace for performing strassen's multiplication </td></tr>
<tr id="row_122_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dd6/namespacestring.html" target="_self">string</a></td><td class="desc">String manipulation algorithms </td></tr>
<tr id="row_123_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </td></tr>
<tr id="row_124_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">String algorithms </td></tr>
<tr id="row_124_0_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/dbc/namespacestrings_1_1boyer__moore.html" target="_self">boyer_moore</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer Moore</a> algorithm implementation </td></tr>
<tr id="row_125_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d74/namespacesubarray__sum.html" target="_self">subarray_sum</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset sum</a> implementation </td></tr>
<tr id="row_126_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/def/namespacesublist__search.html" target="_self">sublist_search</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search</a> implementation </td></tr>
<tr id="row_127_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/d3a/namespacesubset__sum.html" target="_self">subset_sum</a></td><td class="desc">Functions for [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm </td></tr>
<tr id="row_128_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d95/namespace_subsets.html" target="_self">Subsets</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem </td></tr>
<tr id="row_129_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d9f/namespacesudoku__solver.html" target="_self">sudoku_solver</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation </td></tr>
<tr id="row_130_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/df4/namespacetests.html" target="_self">tests</a></td><td class="desc">Testcases to check Union of Two Arrays </td></tr>
<tr id="row_131_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d76/namespacetopological__sort.html" target="_self">topological_sort</a></td><td class="desc">Topological Sort Algorithm </td></tr>
<tr id="row_132_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d3f/namespacetravelling_salesman__bitmanipulation.html" target="_self">travellingSalesman_bitmanipulation</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/" target="_blank">Travelling Salesman Bitmask</a> implementation </td></tr>
<tr id="row_133_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dab/namespacetree__234.html" target="_self">tree_234</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> </td></tr>
<tr id="row_134_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d8e/namespacetrie__operations.html" target="_self">trie_operations</a></td><td class="desc">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> implementation </td></tr>
<tr id="row_135_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d0a/namespacetrie__using__hashmap.html" target="_self">trie_using_hashmap</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using hashmap implementation </td></tr>
<tr id="row_136_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d17/namespaceutil__functions.html" target="_self">util_functions</a></td><td class="desc">Various utility functions used in Neural network </td></tr>
<tr id="row_137_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d84/namespaceutils.html" target="_self">utils</a></td><td class="desc">This namespace contains the definitions of the functions called from the class <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" title="Class which contains all methods required for calculating nCr mod p.">math::ncr_modulo_p::NCRModuloP</a> </td></tr>
<tr id="row_138_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d91/namespacevector__cross.html" target="_self">vector_cross</a></td><td class="desc">Functions for Vector Cross Product algorithms </td></tr>
<tr id="row_139_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/da2/namespacevigenere.html" target="_self">vigenere</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">vigenère cipher</a> algorithm </td></tr>
<tr id="row_140_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d21/namespacewave__sort.html" target="_self">wave_sort</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> implementation </td></tr>
<tr id="row_141_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d52/namespacewiggle__sort.html" target="_self">wiggle_sort</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/wiggle-sort-ii/" target="_blank">Wiggle Sort</a> algorithm </td></tr>
<tr id="row_142_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/d03/namespacewildcard__matching.html" target="_self">wildcard_matching</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem </td></tr>
<tr id="row_143_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d21/namespacewindowed__median.html" target="_self">windowed_median</a></td><td class="desc">Functions for the Windowed Median algorithm implementation </td></tr>
<tr id="row_144_" class="odd"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d53/namespaceword__break.html" target="_self">word_break</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break</a> problem </td></tr>
<tr id="row_145_" class="even"><td class="entry"><span class="spacer">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d47/namespace_x_o_r.html" target="_self">XOR</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm </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.18.0 </li>
</ul>
</div>
</body>
</html>