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

Documentation for 0301b4cd17

Browse Source
This commit is contained in:
realstealthninja
2025-09-24 03:50:39 +00:00
parent 64b178a94c
commit 0373bf6a71
63 changed files with 1801 additions and 922 deletions
Download Patch File Download Diff File Expand all files Collapse all files

91
search/all_e.js
View File

@@ -57,49 +57,50 @@ var searchData=
['is_5farithmetic_3c_20uint256_5ft_20_3e_54',['is_arithmetic< uint256_t >',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]],
['is_5farmstrong_55',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]],
['is_5fbipartite_56',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca',1,'graph::is_graph_bipartite::Graph']]],
['is_5ffactorial_57',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]],
['is_5fgraph_5fbipartite_58',['is_graph_bipartite',['../de/d83/namespaceis__graph__bipartite.html',1,'']]],
['is_5fgraph_5fbipartite_2ecpp_59',['is_graph_bipartite.cpp',['../d6/dd8/is__graph__bipartite_8cpp.html',1,'']]],
['is_5fhappy_60',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]],
['is_5fintegral_3c_20uint128_5ft_20_3e_61',['is_integral< uint128_t >',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]],
['is_5fintegral_3c_20uint256_5ft_20_3e_62',['is_integral< uint256_t >',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]],
['is_5fnumber_63',['is_number',['../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]],
['is_5fprefix_64',['is_prefix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]],
['is_5fprime_65',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]],
['is_5fsquare_66',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]],
['is_5funsigned_3c_20uint128_5ft_20_3e_67',['is_unsigned< uint128_t >',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]],
['is_5funsigned_3c_20uint256_5ft_20_3e_68',['is_unsigned< uint256_t >',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]],
['isbigendian_69',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]],
['isbipartite_70',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]],
['iscyclicbfs_71',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]],
['iscyclicdfs_72',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]],
['iscyclicdfshelper_73',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]],
['isdigit_74',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]],
['isempty_75',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e',1,'data_structures::linked_list::list::isEmpty() const']]],
['isemptyqueue_76',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]],
['isemptystack_77',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]],
['isendofword_78',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]],
['isfull_79',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]],
['isleaf_80',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]],
['ispossible_81',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]],
['ispoweroftwo_82',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]],
['isprime_83',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]],
['isprime_84',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e',1,'math::modular_inverse_fermat']]],
['isprime_85',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]],
['issafe_86',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]],
['issafe_87',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]],
['issame_88',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]],
['isvalidbinarystring_89',['isValidBinaryString',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2',1,'greedy_algorithms::BinaryAddition']]],
['it_5fternary_5fsearch_90',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]],
['item_91',['Item',['../db/d66/struct_item.html',1,'']]],
['items_92',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]],
['iterative_20inorder_20traversal_20of_20a_20tree_93',['Iterative Inorder Traversal of 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']]],
['iterative_20postorder_20traversal_20of_20a_20tree_94',['Iterative Postorder 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']]],
['iterative_20preorder_20traversal_20of_20a_20tree_95',['Iterative Preorder 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']]],
['iterative_5ffactorial_2ecpp_96',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]],
['iterative_5ftree_5ftraversals_97',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]],
['iterative_5ftree_5ftraversals_2ecpp_98',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]],
['iterativefactorial_99',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]],
['iterativequicksort_100',['iterativeQuickSort',['../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5',1,'sorting']]],
['iterator_101',['iterator',['../d9/d5e/classunordered__set_1_1iterator.html',1,'unordered_set< K >::iterator'],['../d0/d05/classvector_1_1iterator.html',1,'vector< T >::iterator']]]
['is_5feven_57',['is_even',['../d4/dcd/check__even__odd_8cpp.html#ac1cbf9fb33c4a37de47d1ed519abc20a',1,'bit_manipulation::even_odd']]],
['is_5ffactorial_58',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]],
['is_5fgraph_5fbipartite_59',['is_graph_bipartite',['../de/d83/namespaceis__graph__bipartite.html',1,'']]],
['is_5fgraph_5fbipartite_2ecpp_60',['is_graph_bipartite.cpp',['../d6/dd8/is__graph__bipartite_8cpp.html',1,'']]],
['is_5fhappy_61',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]],
['is_5fintegral_3c_20uint128_5ft_20_3e_62',['is_integral< uint128_t >',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]],
['is_5fintegral_3c_20uint256_5ft_20_3e_63',['is_integral< uint256_t >',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]],
['is_5fnumber_64',['is_number',['../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]],
['is_5fprefix_65',['is_prefix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]],
['is_5fprime_66',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]],
['is_5fsquare_67',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]],
['is_5funsigned_3c_20uint128_5ft_20_3e_68',['is_unsigned< uint128_t >',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]],
['is_5funsigned_3c_20uint256_5ft_20_3e_69',['is_unsigned< uint256_t >',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]],
['isbigendian_70',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]],
['isbipartite_71',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]],
['iscyclicbfs_72',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]],
['iscyclicdfs_73',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]],
['iscyclicdfshelper_74',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]],
['isdigit_75',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]],
['isempty_76',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e',1,'data_structures::linked_list::list::isEmpty() const']]],
['isemptyqueue_77',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]],
['isemptystack_78',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]],
['isendofword_79',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]],
['isfull_80',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]],
['isleaf_81',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]],
['ispossible_82',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]],
['ispoweroftwo_83',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]],
['isprime_84',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]],
['isprime_85',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e',1,'math::modular_inverse_fermat']]],
['isprime_86',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]],
['issafe_87',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]],
['issafe_88',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]],
['issame_89',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]],
['isvalidbinarystring_90',['isValidBinaryString',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2',1,'greedy_algorithms::BinaryAddition']]],
['it_5fternary_5fsearch_91',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]],
['item_92',['Item',['../db/d66/struct_item.html',1,'']]],
['items_93',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]],
['iterative_20inorder_20traversal_20of_20a_20tree_94',['Iterative Inorder Traversal of 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']]],
['iterative_20postorder_20traversal_20of_20a_20tree_95',['Iterative Postorder 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']]],
['iterative_20preorder_20traversal_20of_20a_20tree_96',['Iterative Preorder 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']]],
['iterative_5ffactorial_2ecpp_97',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]],
['iterative_5ftree_5ftraversals_98',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]],
['iterative_5ftree_5ftraversals_2ecpp_99',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]],
['iterativefactorial_100',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]],
['iterativequicksort_101',['iterativeQuickSort',['../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5',1,'sorting']]],
['iterator_102',['iterator',['../d9/d5e/classunordered__set_1_1iterator.html',1,'unordered_set< K >::iterator'],['../d0/d05/classvector_1_1iterator.html',1,'vector< T >::iterator']]]
];