mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-12 03:28:29 +08:00
Documentation for 821d20c33a
This commit is contained in:
realstealthninja
29
files.html
29
files.html
@@ -343,20 +343,21 @@ N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bis
|
||||
<tr id="row_17_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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 <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse()</a> </td></tr>
|
||||
<tr id="row_17_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><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 <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse()</a> </td></tr>
|
||||
<tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_18_" class="arrow" onclick="dynsection.toggleFolder('18_')">►</span><span id="img_18_" class="iconfclosed" onclick="dynsection.toggleFolder('18_')"> </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;"> </span><span class="icondoc"></span><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;"> </span><span id="arr_19_" class="arrow" onclick="dynsection.toggleFolder('19_')">►</span><span id="img_19_" class="iconfclosed" onclick="dynsection.toggleFolder('19_')"> </span><a class="el" href="dir_82e494173a87936756866de2fa774307.html" target="_self">probability</a></td><td class="desc"></td></tr>
|
||||
|
||||
Reference in New Issue
Block a user