backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-27 03:53:12 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for db3f9d3406

Browse Source
This commit is contained in:
realstealthninja
2024-10-28 15:53:44 +00:00
parent fe2cc4c065
commit 4b0a624473
93 changed files with 1589 additions and 328 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
search/all_6.js
View File

@@ -4,8 +4,8 @@ var searchData=
['a_1',['a',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::a()']]],
['a_20new_20directory_2',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
['a_20program_3',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
['a_20right_20node_20subtree_4',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
['a_20tree_5',['a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md98',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md92',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Preorder Traversal of a tree']]],
['a_20right_20node_20subtree_4',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
['a_20tree_5',['a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
['a1z26_6',['a1z26',['../d8/d2a/namespacea1z26.html',1,'']]],
['a1z26_5fcipher_2ecpp_7',['a1z26_cipher.cpp',['../de/db6/a1z26__cipher_8cpp.html',1,'']]],
['a_5fstar_5fsearch_8',['a_star_search',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201',1,'machine_learning::aystar_search::AyStarSearch']]],
@@ -46,7 +46,7 @@ var searchData=
['addition_5frule_5findependent_43',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]],
['addprocess_44',['addProcess',['../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69',1,'FCFS']]],
['address_45',['address',['http://en.cppreference.com/w/cpp/memory/allocator/address.html',0,'std::allocator']]],
['address_20of_20parent_20nodes_46',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
['address_20of_20parent_20nodes_46',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
['addressing_47',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]],
['addressof_48',['addressof',['http://en.cppreference.com/w/cpp/memory/addressof.html',0,'std']]],
['addvertices_49',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]],
@@ -56,9 +56,9 @@ var searchData=
['adjacent_5ffind_53',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]],
['adopt_5flock_5ft_54',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]],
['advance_55',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]],
['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md74',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md75',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md82',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md83',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md84',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md85',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md87',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md101',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md107',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md109',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md114',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md115',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]],
['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_57',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]],
['algorithm_20explanation_58',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md96',1,'']]],
['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md116',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]],
['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_57',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
['algorithm_20explanation_58',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]],
['algorithms_59',['Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms'],['../d9/d66/group__machine__learning.html',1,'Machine Learning Algorithms']]],
['algorithms_20c_60',['The Algorithms - C++',['../index.html',1,'']]],
['align_61',['align',['http://en.cppreference.com/w/cpp/memory/align.html',0,'std']]],
@@ -76,11 +76,11 @@ var searchData=
['allocator_5ftraits_73',['allocator_traits',['http://en.cppreference.com/w/cpp/memory/allocator_traits.html',0,'std']]],
['alpha_74',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]],
['always_5fnoconv_75',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()']]],
['analysis_20best_20case_20worst_20case_20average_20case_76',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'']]],
['analysis_20best_20case_20worst_20case_20average_20case_76',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
['analyzer_77',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]],
['and_20conquer_78',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]],
['and_20maintainers_79',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
['and_20not_20matching_20edges_80',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]],
['and_20not_20matching_20edges_80',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
['and_5ftest_81',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]],
['ans_82',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]],
['any_83',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]],
@@ -159,11 +159,11 @@ var searchData=
['atomic_5fstore_5fexplicit_156',['atomic_store_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]],
['atomic_5fthread_5ffence_157',['atomic_thread_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html',0,'std']]],
['attribution_158',['Attribution',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15',1,'']]],
['augmenting_20paths_159',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]],
['augmenting_20paths_159',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]],
['auto_5fptr_160',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr.html',0,'std::auto_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/auto_ptr.html',0,'std::auto_ptr::auto_ptr()']]],
['auxiliary_5fq_161',['auxiliary_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323',1,'data_structures::stack_using_queue::Stack']]],
['availarray_162',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]],
['average_20case_163',['Average Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md110',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)']]],
['average_20case_163',['Average Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)']]],
['avltree_2ecpp_164',['avltree.cpp',['../d8/dee/avltree_8cpp.html',1,'']]],
['aystar_5fsearch_165',['aystar_search',['../db/ddc/namespaceaystar__search.html',1,'']]],
['aystarsearch_166',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html',1,'machine_learning::aystar_search::AyStarSearch< Puzzle >'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e',1,'machine_learning::aystar_search::AyStarSearch::AyStarSearch()']]]