From 93021161c2a273df8447b17e09de6b3f2fc9c23f Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Fri, 19 Jun 2020 16:07:44 +0000 Subject: [PATCH] Documentation for aaa08b0150acc987a47f87b26d64dbbdf96945ac --- annotated.html | 150 + annotated_dup.js | 37 + bc_s.png | Bin 0 -> 676 bytes bdwn.png | Bin 0 -> 147 bytes classes.html | 192 ++ closed.png | Bin 0 -> 132 bytes d0/d01/smallest__circle_8cpp.html | 572 ++++ d0/d01/smallest__circle_8cpp.js | 12 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 11 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 254 ++ ...86819c7c140a023582b7269e2d0_cgraph_org.svg | 166 + ...b0676df8e4da7a08c7ccaecea344903_cgraph.map | 9 + ...b0676df8e4da7a08c7ccaecea344903_cgraph.md5 | 1 + ...b0676df8e4da7a08c7ccaecea344903_cgraph.svg | 130 + ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map | 4 + ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 | 1 + ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg | 37 + ...d0455dd5c30adda100e95f0423c786e_cgraph.map | 11 + ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 | 1 + ...d0455dd5c30adda100e95f0423c786e_cgraph.svg | 254 ++ ...5dd5c30adda100e95f0423c786e_cgraph_org.svg | 166 + ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.map | 5 + ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 | 1 + ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.svg | 52 + ...1a3968e7947464bee7714f6d43b7002_cgraph.map | 11 + ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 | 1 + ...1a3968e7947464bee7714f6d43b7002_cgraph.svg | 254 ++ ...68e7947464bee7714f6d43b7002_cgraph_org.svg | 166 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 14 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 341 ++ ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg | 253 ++ ...e6d48762c1dfb9f14627927f0c16fad_cgraph.map | 6 + ...e6d48762c1dfb9f14627927f0c16fad_cgraph.md5 | 1 + ...e6d48762c1dfb9f14627927f0c16fad_cgraph.svg | 67 + d0/d04/qr__decompose_8h__incl.map | 10 + d0/d04/qr__decompose_8h__incl.md5 | 1 + d0/d04/qr__decompose_8h__incl.svg | 128 + d0/d08/realtime__stats_8cpp.html | 313 ++ d0/d08/realtime__stats_8cpp.js | 7 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 14 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 353 +++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 265 ++ ...54c915581fcc495489175a4386d59fd_cgraph.map | 13 + ...54c915581fcc495489175a4386d59fd_cgraph.md5 | 1 + ...54c915581fcc495489175a4386d59fd_cgraph.svg | 196 ++ d0/d0d/structmst-members.html | 114 + d0/d1f/structnode__coll__graph.map | 3 + d0/d1f/structnode__coll__graph.md5 | 1 + d0/d1f/structnode__coll__graph.svg | 33 + d0/d55/classcll-members.html | 122 + d0/d77/linear__search_8cpp__incl.map | 4 + d0/d77/linear__search_8cpp__incl.md5 | 1 + d0/d77/linear__search_8cpp__incl.svg | 37 + ...tatistics_1_1stats__computer1-members.html | 120 + d0/d80/classgraph__coll__graph.map | 6 + d0/d80/classgraph__coll__graph.md5 | 1 + d0/d80/classgraph__coll__graph.svg | 78 + d0/da1/string__fibonacci_8cpp__incl.map | 5 + d0/da1/string__fibonacci_8cpp__incl.md5 | 1 + d0/da1/string__fibonacci_8cpp__incl.svg | 52 + .../number__of__positive__divisors_8cpp.html | 241 ++ d0/da2/number__of__positive__divisors_8cpp.js | 5 + ...89ccced8504b5116046cfa03066ffeb_cgraph.map | 5 + ...89ccced8504b5116046cfa03066ffeb_cgraph.md5 | 1 + ...89ccced8504b5116046cfa03066ffeb_cgraph.svg | 53 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 83 + d0/dab/interpolation__search_8cpp__incl.map | 4 + d0/dab/interpolation__search_8cpp__incl.md5 | 1 + d0/dab/interpolation__search_8cpp__incl.svg | 38 + d0/db5/trie__modern_8cpp__incl.map | 6 + d0/db5/trie__modern_8cpp__incl.md5 | 1 + d0/db5/trie__modern_8cpp__incl.svg | 68 + d0/db6/non__recursive__merge__sort_8cpp.html | 153 + d0/db6/non__recursive__merge__sort_8cpp.js | 8 + d0/db7/smallest__circle_8cpp__incl.map | 6 + d0/db7/smallest__circle_8cpp__incl.md5 | 1 + d0/db7/smallest__circle_8cpp__incl.svg | 67 + d0/dc4/struct_point-members.html | 116 + .../successive__approximation_8cpp__incl.map | 5 + .../successive__approximation_8cpp__incl.md5 | 1 + .../successive__approximation_8cpp__incl.svg | 53 + d0/dd1/binaryheap_8cpp__incl.map | 6 + d0/dd1/binaryheap_8cpp__incl.md5 | 1 + d0/dd1/binaryheap_8cpp__incl.svg | 67 + d0/dd2/class_queue___array.html | 148 + d0/dd2/class_queue___array.js | 11 + d0/dd5/ode__midpoint__euler_8cpp__incl.map | 8 + d0/dd5/ode__midpoint__euler_8cpp__incl.md5 | 1 + d0/dd5/ode__midpoint__euler_8cpp__incl.svg | 98 + d0/de2/gaussian__elimination_8cpp.html | 226 ++ d0/de2/gaussian__elimination_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d0/dfc/sqrt__double_8cpp__incl.map | 5 + d0/dfc/sqrt__double_8cpp__incl.md5 | 1 + d0/dfc/sqrt__double_8cpp__incl.svg | 52 + d0/dff/structlinkedlist.html | 131 + d0/dff/structlinkedlist.js | 5 + d1/d06/ternary__search_8cpp__incl.map | 4 + d1/d06/ternary__search_8cpp__incl.md5 | 1 + d1/d06/ternary__search_8cpp__incl.svg | 37 + d1/d07/class_solution-members.html | 119 + d1/d11/gcd__of__n__numbers_8cpp.html | 223 ++ d1/d11/gcd__of__n__numbers_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d1/d1d/class_graph-members.html | 153 + d1/d1d/pascal__triangle_8cpp__incl.map | 6 + d1/d1d/pascal__triangle_8cpp__incl.md5 | 1 + d1/d1d/pascal__triangle_8cpp__incl.svg | 67 + d1/d21/quick__sort_8cpp.html | 202 ++ d1/d21/quick__sort_8cpp.js | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 67 + ...__least__squares__regressor_8cpp__incl.map | 6 + ...__least__squares__regressor_8cpp__incl.md5 | 1 + ...__least__squares__regressor_8cpp__incl.svg | 68 + d1/d57/classcll__coll__graph.map | 4 + d1/d57/classcll__coll__graph.md5 | 1 + d1/d57/classcll__coll__graph.svg | 49 + d1/d76/buzz__number_8cpp.html | 169 + d1/d76/buzz__number_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d1/d77/structmst.html | 128 + d1/d77/structmst.js | 6 + d1/d7d/gcd__of__n__numbers_8cpp__incl.map | 4 + d1/d7d/gcd__of__n__numbers_8cpp__incl.md5 | 1 + d1/d7d/gcd__of__n__numbers_8cpp__incl.svg | 37 + .../decimal__to__hexadecimal_8cpp__incl.map | 4 + .../decimal__to__hexadecimal_8cpp__incl.md5 | 1 + .../decimal__to__hexadecimal_8cpp__incl.svg | 37 + d1/db3/structcompare.html | 122 + d1/db3/structcompare.js | 4 + d1/dc2/class_graph__coll__graph.map | 9 + d1/dc2/class_graph__coll__graph.md5 | 1 + d1/dc2/class_graph__coll__graph.svg | 123 + d1/dc2/classstack.html | 520 ++++ d1/dc2/classstack.js | 14 + ...7f65710c376f67d1ba3bde45a9cb628_cgraph.map | 4 + ...7f65710c376f67d1ba3bde45a9cb628_cgraph.md5 | 1 + ...7f65710c376f67d1ba3bde45a9cb628_cgraph.svg | 37 + ...cd4b95d5de00d41b2491392338384dc_cgraph.map | 5 + ...cd4b95d5de00d41b2491392338384dc_cgraph.md5 | 1 + ...cd4b95d5de00d41b2491392338384dc_cgraph.svg | 52 + d1/dc5/classlarge__number__coll__graph.map | 4 + d1/dc5/classlarge__number__coll__graph.md5 | 1 + d1/dc5/classlarge__number__coll__graph.svg | 39 + d1/dda/fast__interger__input_8cpp__incl.map | 4 + d1/dda/fast__interger__input_8cpp__incl.md5 | 1 + d1/dda/fast__interger__input_8cpp__incl.svg | 38 + d1/df2/structnode-members.html | 127 + d1/df3/hash__search_8cpp.html | 406 +++ d1/df3/hash__search_8cpp.js | 14 + ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map | 4 + ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 | 1 + ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg | 37 + ...0831425f1389166a9518f422d0c6ec5_cgraph.map | 4 + ...0831425f1389166a9518f422d0c6ec5_cgraph.md5 | 1 + ...0831425f1389166a9518f422d0c6ec5_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 88 + d1/df9/qr__decomposition_8cpp__incl.map | 13 + d1/df9/qr__decomposition_8cpp__incl.md5 | 1 + d1/df9/qr__decomposition_8cpp__incl.svg | 191 ++ d2/d05/class_min_heap.html | 478 +++ d2/d05/class_min_heap.js | 16 + ...7ac126eabb0c3ce04047172abccca29_cgraph.map | 9 + ...7ac126eabb0c3ce04047172abccca29_cgraph.md5 | 1 + ...7ac126eabb0c3ce04047172abccca29_cgraph.svg | 206 ++ ...26eabb0c3ce04047172abccca29_cgraph_org.svg | 118 + ...014f1edaed0bd7db0c0d2ca53228980_cgraph.map | 7 + ...014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 | 1 + ...014f1edaed0bd7db0c0d2ca53228980_cgraph.svg | 82 + ...7f726cc6327955d22871592227432f5_cgraph.map | 4 + ...7f726cc6327955d22871592227432f5_cgraph.md5 | 1 + ...7f726cc6327955d22871592227432f5_cgraph.svg | 37 + ...ef438c1056492cb62c4a4d9035b5cad_cgraph.map | 6 + ...ef438c1056492cb62c4a4d9035b5cad_cgraph.md5 | 1 + ...ef438c1056492cb62c4a4d9035b5cad_cgraph.svg | 67 + ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.map | 4 + ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 | 1 + ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.svg | 37 + d2/d07/class_bit__coll__graph.map | 4 + d2/d07/class_bit__coll__graph.md5 | 1 + d2/d07/class_bit__coll__graph.svg | 38 + d2/d0b/fast__power_8cpp.html | 301 ++ d2/d0b/fast__power_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 8 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 98 + d2/d22/jump__search_8cpp.html | 209 ++ d2/d22/jump__search_8cpp.js | 5 + ...49fd8f401bfc71f63b74711390cccf0_cgraph.map | 5 + ...49fd8f401bfc71f63b74711390cccf0_cgraph.md5 | 1 + ...49fd8f401bfc71f63b74711390cccf0_cgraph.svg | 52 + d2/d26/addition__rule_8cpp__incl.map | 4 + d2/d26/addition__rule_8cpp__incl.md5 | 1 + d2/d26/addition__rule_8cpp__incl.svg | 38 + d2/d2c/structtower.html | 129 + d2/d2c/structtower.js | 5 + d2/d36/structqueue.html | 517 ++++ d2/d36/structqueue.js | 17 + ...89d4af5532e0a801f560070da6e1f86_cgraph.map | 5 + ...89d4af5532e0a801f560070da6e1f86_cgraph.md5 | 1 + ...89d4af5532e0a801f560070da6e1f86_cgraph.svg | 52 + ...6f48801df462ade003b50739196fa4c_cgraph.map | 4 + ...6f48801df462ade003b50739196fa4c_cgraph.md5 | 1 + ...6f48801df462ade003b50739196fa4c_cgraph.svg | 37 + d2/d3b/namespaceqr__algorithm.html | 634 ++++ ...40edf2b6b5942c0e5f2c9d3e326797f_cgraph.map | 6 + ...40edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5 | 1 + ...40edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg | 67 + ...63896dbb4a7e95c4a1e614ac0819d66_cgraph.map | 9 + ...63896dbb4a7e95c4a1e614ac0819d66_cgraph.md5 | 1 + ...63896dbb4a7e95c4a1e614ac0819d66_cgraph.svg | 201 ++ ...6dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg | 113 + ...c63c78d6839b8ad73b77c161210b514_cgraph.map | 7 + ...c63c78d6839b8ad73b77c161210b514_cgraph.md5 | 1 + ...c63c78d6839b8ad73b77c161210b514_cgraph.svg | 82 + ...1ac74497ffb2101040cc1efe3546de8_cgraph.map | 7 + ...1ac74497ffb2101040cc1efe3546de8_cgraph.md5 | 1 + ...1ac74497ffb2101040cc1efe3546de8_cgraph.svg | 82 + ...16da2183db22378435042f26af43d5f_cgraph.map | 5 + ...16da2183db22378435042f26af43d5f_cgraph.md5 | 1 + ...16da2183db22378435042f26af43d5f_cgraph.svg | 52 + d2/d66/binary__search_8cpp__incl.map | 4 + d2/d66/binary__search_8cpp__incl.md5 | 1 + d2/d66/binary__search_8cpp__incl.svg | 37 + d2/d89/median__search_8cpp__incl.map | 6 + d2/d89/median__search_8cpp__incl.md5 | 1 + d2/d89/median__search_8cpp__incl.svg | 67 + d2/dc4/classstack__linked_list.html | 144 + d2/dc4/classstack__linked_list.js | 9 + d2/dcf/namespacestatistics.html | 124 + d2/dcf/namespacestatistics.js | 5 + d2/ddd/gaussian__elimination_8cpp__incl.map | 4 + d2/ddd/gaussian__elimination_8cpp__incl.md5 | 1 + d2/ddd/gaussian__elimination_8cpp__incl.svg | 38 + d2/def/prime__factorization_8cpp__incl.map | 7 + d2/def/prime__factorization_8cpp__incl.md5 | 1 + d2/def/prime__factorization_8cpp__incl.svg | 82 + d3/d06/ode__semi__implicit__euler_8cpp.html | 414 +++ d3/d06/ode__semi__implicit__euler_8cpp.js | 9 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 16 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 241 ++ ...13517b8e5de1b75592052db7f7e237f_cgraph.map | 10 + ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 | 1 + ...13517b8e5de1b75592052db7f7e237f_cgraph.svg | 127 + ...3adf7b092a87868917ee5fb4255192b_cgraph.map | 5 + ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 | 1 + ...3adf7b092a87868917ee5fb4255192b_cgraph.svg | 52 + d3/d19/sparse__matrix_8cpp.html | 188 ++ d3/d19/sparse__matrix_8cpp.js | 4 + ...se__fermat__little__theorem_8cpp__incl.map | 5 + ...se__fermat__little__theorem_8cpp__incl.md5 | 1 + ...se__fermat__little__theorem_8cpp__incl.svg | 53 + d3/d24/qr__decomposition_8cpp.html | 203 ++ d3/d24/qr__decomposition_8cpp.js | 4 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.map | 9 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.md5 | 1 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.svg | 200 ++ ...1bc02cba5474a4cb46a9b9566fe_cgraph_org.svg | 112 + d3/d26/binary__search__tree_8cpp.html | 174 ++ d3/d26/binary__search__tree_8cpp.js | 16 + d3/d30/hash__search_8cpp__incl.map | 5 + d3/d30/hash__search_8cpp__incl.md5 | 1 + d3/d30/hash__search_8cpp__incl.svg | 52 + d3/d39/check__prime_8cpp__incl.map | 5 + d3/d39/check__prime_8cpp__incl.md5 | 1 + d3/d39/check__prime_8cpp__incl.svg | 52 + d3/d56/binomial__dist_8cpp__incl.map | 5 + d3/d56/binomial__dist_8cpp__incl.md5 | 1 + d3/d56/binomial__dist_8cpp__incl.svg | 53 + d3/d61/vector__important__functions_8cpp.html | 197 ++ d3/d61/vector__important__functions_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + d3/d66/structlinkedlist__coll__graph.map | 3 + d3/d66/structlinkedlist__coll__graph.md5 | 1 + d3/d66/structlinkedlist__coll__graph.svg | 29 + .../brute__force__string__searching_8cpp.html | 206 ++ .../brute__force__string__searching_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 83 + ...tatistics_1_1stats__computer2-members.html | 120 + d3/dbb/class_cycle_check.html | 397 +++ d3/dbb/class_cycle_check.js | 11 + ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map | 5 + ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 | 1 + ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg | 53 + ...99292a33edf87499daa52b51315aca5_cgraph.map | 7 + ...99292a33edf87499daa52b51315aca5_cgraph.md5 | 1 + ...99292a33edf87499daa52b51315aca5_cgraph.svg | 82 + ...9a270ffba3a68539b92272c702e3474_cgraph.map | 6 + ...9a270ffba3a68539b92272c702e3474_cgraph.md5 | 1 + ...9a270ffba3a68539b92272c702e3474_cgraph.svg | 68 + ...edlist__implentation__usingarray_8cpp.html | 307 ++ ...nkedlist__implentation__usingarray_8cpp.js | 14 + ...cb07da7984e20b3207934696791f5df_cgraph.map | 4 + ...cb07da7984e20b3207934696791f5df_cgraph.md5 | 1 + ...cb07da7984e20b3207934696791f5df_cgraph.svg | 37 + d4/d0c/binary__search__tree_8cpp__incl.map | 4 + d4/d0c/binary__search__tree_8cpp__incl.md5 | 1 + d4/d0c/binary__search__tree_8cpp__incl.svg | 38 + d4/d0e/class_bit-members.html | 119 + d4/d1f/class_min_heap-members.html | 124 + d4/d21/least__common__multiple_8cpp.html | 293 ++ d4/d21/least__common__multiple_8cpp.js | 7 + ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map | 6 + ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 | 1 + ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg | 67 + ...8d0e241db517813725e721a152e3a25_cgraph.map | 4 + ...8d0e241db517813725e721a152e3a25_cgraph.md5 | 1 + ...8d0e241db517813725e721a152e3a25_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + d4/d26/durand__kerner__roots_8cpp__incl.map | 12 + d4/d26/durand__kerner__roots_8cpp__incl.md5 | 1 + d4/d26/durand__kerner__roots_8cpp__incl.svg | 246 ++ .../durand__kerner__roots_8cpp__incl_org.svg | 158 + ...struct_trie_1_1_trie_node__coll__graph.map | 4 + ...struct_trie_1_1_trie_node__coll__graph.md5 | 1 + ...struct_trie_1_1_trie_node__coll__graph.svg | 46 + d4/d32/fibonacci__fast_8cpp.html | 246 ++ d4/d32/fibonacci__fast_8cpp.js | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d4/d45/gcd__recursive__euclidean_8cpp.html | 225 ++ d4/d45/gcd__recursive__euclidean_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d4/d59/large__factorial_8cpp__incl.map | 12 + d4/d59/large__factorial_8cpp__incl.md5 | 1 + d4/d59/large__factorial_8cpp__incl.svg | 169 + d4/d60/kohonen__som__trace_8cpp__incl.map | 11 + d4/d60/kohonen__som__trace_8cpp__incl.md5 | 1 + d4/d60/kohonen__som__trace_8cpp__incl.svg | 231 ++ d4/d60/kohonen__som__trace_8cpp__incl_org.svg | 143 + d4/d68/qr__decompose_8h.html | 167 + d4/d68/qr__decompose_8h.js | 9 + d4/d68/qr__decompose_8h_source.html | 473 +++ d4/d6d/struct_entry-members.html | 115 + d4/d72/qr__eigen__values_8cpp__incl.map | 13 + d4/d72/qr__eigen__values_8cpp__incl.md5 | 1 + d4/d72/qr__eigen__values_8cpp__incl.svg | 191 ++ d4/d7a/shell__sort2_8cpp.html | 522 ++++ d4/d7a/shell__sort2_8cpp.js | 12 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 14 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 235 ++ ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.map | 8 + ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 | 1 + ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg | 97 + ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map | 5 + ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 | 1 + ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg | 52 + ...95b313cb2671e8f712040460325573e_cgraph.map | 8 + ...95b313cb2671e8f712040460325573e_cgraph.md5 | 1 + ...95b313cb2671e8f712040460325573e_cgraph.svg | 97 + ...51127aea9d7e1e53ea9ae0868633246_cgraph.map | 4 + ...51127aea9d7e1e53ea9ae0868633246_cgraph.md5 | 1 + ...51127aea9d7e1e53ea9ae0868633246_cgraph.svg | 37 + d4/d86/large__number_8h.html | 144 + d4/d86/large__number_8h_source.html | 655 ++++ d4/d9c/primes__up__to__billion_8cpp.html | 226 ++ d4/d9c/primes__up__to__billion_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d4/da0/gcd__iterative__euclidean_8cpp.html | 231 ++ d4/da0/gcd__iterative__euclidean_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d4/da4/class_queue.html | 147 + d4/da4/class_queue.js | 10 + ...ber__of__positive__divisors_8cpp__incl.map | 5 + ...ber__of__positive__divisors_8cpp__incl.md5 | 1 + ...ber__of__positive__divisors_8cpp__incl.svg | 53 + d4/db4/bayes__theorem_8cpp__incl.map | 4 + d4/db4/bayes__theorem_8cpp__incl.md5 | 1 + d4/db4/bayes__theorem_8cpp__incl.svg | 37 + d4/db4/struct_segment_intersection.html | 240 ++ d4/db4/struct_segment_intersection.js | 6 + ...08941b2272866c64cdaf959afa939bf_cgraph.map | 5 + ...08941b2272866c64cdaf959afa939bf_cgraph.md5 | 1 + ...08941b2272866c64cdaf959afa939bf_cgraph.svg | 53 + d4/db6/struct_min_heap_node-members.html | 116 + d4/dbd/structlca__coll__graph.map | 4 + d4/dbd/structlca__coll__graph.md5 | 1 + d4/dbd/structlca__coll__graph.svg | 38 + ...extended__euclid__algorithm_8cpp__incl.map | 5 + ...extended__euclid__algorithm_8cpp__incl.md5 | 1 + ...extended__euclid__algorithm_8cpp__incl.svg | 53 + d4/dcb/classstack__coll__graph.map | 5 + d4/dcb/classstack__coll__graph.md5 | 1 + d4/dcb/classstack__coll__graph.svg | 76 + d4/dd9/structtrie.html | 131 + d4/dd9/structtrie.js | 5 + d4/de8/fast__interger__input_8cpp.html | 211 ++ d4/de8/fast__interger__input_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + .../gcd__iterative__euclidean_8cpp__incl.map | 5 + .../gcd__iterative__euclidean_8cpp__incl.md5 | 1 + .../gcd__iterative__euclidean_8cpp__incl.svg | 53 + d4/def/kohonen__som__topology_8cpp.html | 693 +++++ d4/def/kohonen__som__topology_8cpp.js | 19 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 25 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 466 +++ ...86819c7c140a023582b7269e2d0_cgraph_org.svg | 378 +++ ...e7435446ed7c763f7de79a468add2e0_cgraph.map | 5 + ...e7435446ed7c763f7de79a468add2e0_cgraph.md5 | 1 + ...e7435446ed7c763f7de79a468add2e0_cgraph.svg | 52 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 25 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 466 +++ ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg | 378 +++ ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 34 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 685 +++++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 597 ++++ ...b5e744876fd980a3451cbb385d4e755_cgraph.map | 5 + ...b5e744876fd980a3451cbb385d4e755_cgraph.md5 | 1 + ...b5e744876fd980a3451cbb385d4e755_cgraph.svg | 52 + ...d0455dd5c30adda100e95f0423c786e_cgraph.map | 25 + ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 | 1 + ...d0455dd5c30adda100e95f0423c786e_cgraph.svg | 466 +++ ...5dd5c30adda100e95f0423c786e_cgraph_org.svg | 378 +++ ...3081e021270ba21a9fd88646f6a6e26_cgraph.map | 5 + ...3081e021270ba21a9fd88646f6a6e26_cgraph.md5 | 1 + ...3081e021270ba21a9fd88646f6a6e26_cgraph.svg | 52 + d4/df8/prime__numbers_8cpp__incl.map | 5 + d4/df8/prime__numbers_8cpp__incl.md5 | 1 + d4/df8/prime__numbers_8cpp__incl.svg | 52 + d5/d15/classcll.html | 157 + d5/d15/classcll.js | 14 + d5/d29/struct_min_heap_node.html | 144 + d5/d29/struct_min_heap_node.js | 8 + d5/d67/bayes__theorem_8cpp.html | 249 ++ d5/d67/bayes__theorem_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 67 + d5/d88/md__d_i_r_e_c_t_o_r_y.html | 372 +++ d5/d8b/least__common__multiple_8cpp__incl.map | 5 + d5/d8b/least__common__multiple_8cpp__incl.md5 | 1 + d5/d8b/least__common__multiple_8cpp__incl.svg | 52 + d5/d91/namespacesorting.html | 606 ++++ ...40d913e42fb94176a0b2c8b29a80420_cgraph.map | 4 + ...40d913e42fb94176a0b2c8b29a80420_cgraph.md5 | 1 + ...40d913e42fb94176a0b2c8b29a80420_cgraph.svg | 38 + ...7236b8d3df3832e1f1225576a122534_cgraph.map | 5 + ...7236b8d3df3832e1f1225576a122534_cgraph.md5 | 1 + ...7236b8d3df3832e1f1225576a122534_cgraph.svg | 54 + ...d76603c54d3dc56146e92d10a043924_cgraph.map | 4 + ...d76603c54d3dc56146e92d10a043924_cgraph.md5 | 1 + ...d76603c54d3dc56146e92d10a043924_cgraph.svg | 37 + ...0b66a1c652291b9a346ec7342967178_cgraph.map | 4 + ...0b66a1c652291b9a346ec7342967178_cgraph.md5 | 1 + ...0b66a1c652291b9a346ec7342967178_cgraph.svg | 37 + ...97f4dd815654c4682f564afd718e824_cgraph.map | 5 + ...97f4dd815654c4682f564afd718e824_cgraph.md5 | 1 + ...97f4dd815654c4682f564afd718e824_cgraph.svg | 54 + ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.map | 4 + ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 | 1 + ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg | 37 + d5/da1/structnode.html | 197 ++ d5/da1/structnode.js | 19 + d5/db0/adaline__learning_8cpp.html | 434 +++ d5/db0/adaline__learning_8cpp.js | 9 + ...79f7488a305f2571f2932b319931f82_cgraph.map | 13 + ...79f7488a305f2571f2932b319931f82_cgraph.md5 | 1 + ...79f7488a305f2571f2932b319931f82_cgraph.svg | 286 ++ ...488a305f2571f2932b319931f82_cgraph_org.svg | 198 ++ ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 18 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 409 +++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 321 ++ ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.map | 12 + ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 | 1 + ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg | 271 ++ ...d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg | 183 ++ ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map | 13 + ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 | 1 + ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg | 286 ++ ...f1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg | 198 ++ d5/dc2/structlca-members.html | 120 + ...ector__important__functions_8cpp__incl.map | 7 + ...ector__important__functions_8cpp__incl.md5 | 1 + ...ector__important__functions_8cpp__incl.svg | 83 + d5/dcd/kohonen__som__topology_8cpp__incl.map | 11 + d5/dcd/kohonen__som__topology_8cpp__incl.md5 | 1 + d5/dcd/kohonen__som__topology_8cpp__incl.svg | 231 ++ .../kohonen__som__topology_8cpp__incl_org.svg | 143 + d5/ddf/struct_btree-members.html | 114 + d5/de2/structtower-members.html | 113 + d5/def/stairs__pattern_8cpp.html | 185 ++ d5/def/stairs__pattern_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d6/d1d/bubble__sort_8cpp__incl.map | 5 + d6/d1d/bubble__sort_8cpp__incl.md5 | 1 + d6/d1d/bubble__sort_8cpp__incl.svg | 52 + d6/d30/classmachine__learning_1_1adaline.html | 558 ++++ d6/d30/classmachine__learning_1_1adaline.js | 13 + ...acbe32aaab897e7939e5b0454035b8c_cgraph.map | 6 + ...acbe32aaab897e7939e5b0454035b8c_cgraph.md5 | 1 + ...acbe32aaab897e7939e5b0454035b8c_cgraph.svg | 68 + ...4e3c6c037b67895014414c5d75465e5_cgraph.map | 11 + ...4e3c6c037b67895014414c5d75465e5_cgraph.md5 | 1 + ...4e3c6c037b67895014414c5d75465e5_cgraph.svg | 244 ++ ...6c037b67895014414c5d75465e5_cgraph_org.svg | 156 + ...11242d9ad5b03a75911e29b04f78fd3_cgraph.map | 10 + ...11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 | 1 + ...11242d9ad5b03a75911e29b04f78fd3_cgraph.svg | 129 + ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map | 5 + ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 | 1 + ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg | 53 + d6/d38/newton__raphson__method_8cpp__incl.map | 7 + d6/d38/newton__raphson__method_8cpp__incl.md5 | 1 + d6/d38/newton__raphson__method_8cpp__incl.svg | 83 + d6/d48/structtrie-members.html | 113 + d6/d4a/addition__rule_8cpp.html | 245 ++ d6/d4a/addition__rule_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 67 + .../gcd__recursive__euclidean_8cpp__incl.map | 4 + .../gcd__recursive__euclidean_8cpp__incl.md5 | 1 + .../gcd__recursive__euclidean_8cpp__incl.svg | 38 + d6/d60/group__ode.html | 659 ++++ d6/d60/group__ode.js | 9 + ...6ff0710861ca39d957046c0b09b2985_cgraph.map | 10 + ...6ff0710861ca39d957046c0b09b2985_cgraph.md5 | 1 + ...6ff0710861ca39d957046c0b09b2985_cgraph.svg | 127 + ...874d294ab00fe9ce8731c5b7991a089_cgraph.map | 10 + ...874d294ab00fe9ce8731c5b7991a089_cgraph.md5 | 1 + ...874d294ab00fe9ce8731c5b7991a089_cgraph.svg | 127 + ...27bf009831ddc477c5fa8891d5cb35f_cgraph.map | 4 + ...27bf009831ddc477c5fa8891d5cb35f_cgraph.md5 | 1 + ...27bf009831ddc477c5fa8891d5cb35f_cgraph.svg | 37 + ...c319db420c3d97a83e9dcca803b6812_cgraph.map | 4 + ...c319db420c3d97a83e9dcca803b6812_cgraph.md5 | 1 + ...c319db420c3d97a83e9dcca803b6812_cgraph.svg | 37 + ...197c6b7085ac9ea71abc4c063e6f52f_cgraph.map | 4 + ...197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5 | 1 + ...197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg | 37 + ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.map | 10 + ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 | 1 + ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg | 127 + d6/d93/large__number_8h__dep__incl.map | 5 + d6/d93/large__number_8h__dep__incl.md5 | 1 + d6/d93/large__number_8h__dep__incl.svg | 52 + d6/d9d/large__factorial_8cpp.html | 328 ++ d6/d9d/large__factorial_8cpp.js | 6 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 14 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 318 ++ ...224851353fc92bfbff6f499fa97_cgraph_org.svg | 230 ++ ...f93b60e229b6683e24c4754a7106ee8_cgraph.map | 7 + ...f93b60e229b6683e24c4754a7106ee8_cgraph.md5 | 1 + ...f93b60e229b6683e24c4754a7106ee8_cgraph.svg | 88 + ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.map | 7 + ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 | 1 + ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg | 88 + d6/db0/binomial__dist_8cpp.html | 468 +++ d6/db0/binomial__dist_8cpp.js | 10 + ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map | 5 + ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 | 1 + ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg | 52 + ...6ed6ce71415fb400b65f0656cef3d25_cgraph.map | 5 + ...6ed6ce71415fb400b65f0656cef3d25_cgraph.md5 | 1 + ...6ed6ce71415fb400b65f0656cef3d25_cgraph.svg | 52 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 12 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 175 ++ ...09e51f513cee647d41192ab0a872cdc_cgraph.map | 5 + ...09e51f513cee647d41192ab0a872cdc_cgraph.md5 | 1 + ...09e51f513cee647d41192ab0a872cdc_cgraph.svg | 52 + .../ode__semi__implicit__euler_8cpp__incl.map | 8 + .../ode__semi__implicit__euler_8cpp__incl.md5 | 1 + .../ode__semi__implicit__euler_8cpp__incl.svg | 98 + d6/dbc/sparse__matrix_8cpp__incl.map | 4 + d6/dbc/sparse__matrix_8cpp__incl.md5 | 1 + d6/dbc/sparse__matrix_8cpp__incl.svg | 37 + d6/dbd/jump__search_8cpp__incl.map | 6 + d6/dbd/jump__search_8cpp__incl.md5 | 1 + d6/dbd/jump__search_8cpp__incl.svg | 67 + d6/dc0/interpolation__search2_8cpp__incl.map | 4 + d6/dc0/interpolation__search2_8cpp__incl.md5 | 1 + d6/dc0/interpolation__search2_8cpp__incl.svg | 38 + d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html | 215 ++ d6/dce/rabin__karp_8cpp.html | 189 ++ d6/dce/rabin__karp_8cpp.js | 9 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.map | 8 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.md5 | 1 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.svg | 98 + d6/dd3/ode__midpoint__euler_8cpp.html | 414 +++ d6/dd3/ode__midpoint__euler_8cpp.js | 9 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 16 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 241 ++ ...13517b8e5de1b75592052db7f7e237f_cgraph.map | 10 + ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 | 1 + ...13517b8e5de1b75592052db7f7e237f_cgraph.svg | 127 + ...3adf7b092a87868917ee5fb4255192b_cgraph.map | 5 + ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 | 1 + ...3adf7b092a87868917ee5fb4255192b_cgraph.svg | 52 + d7/d1f/realtime__stats_8cpp__incl.map | 6 + d7/d1f/realtime__stats_8cpp__incl.md5 | 1 + d7/d1f/realtime__stats_8cpp__incl.svg | 67 + d7/d21/classstack__linked_list-members.html | 117 + d7/d2e/avltree_8cpp__incl.map | 6 + d7/d2e/avltree_8cpp__incl.md5 | 1 + d7/d2e/avltree_8cpp__incl.svg | 67 + d7/d35/matrix__exponentiation_8cpp.html | 495 +++ d7/d35/matrix__exponentiation_8cpp.js | 16 + ...769b745458157ef2679949155684f3b_cgraph.map | 4 + ...769b745458157ef2679949155684f3b_cgraph.md5 | 1 + ...769b745458157ef2679949155684f3b_cgraph.svg | 37 + ...t__implentation__usingarray_8cpp__incl.map | 4 + ...t__implentation__usingarray_8cpp__incl.md5 | 1 + ...t__implentation__usingarray_8cpp__incl.svg | 38 + d7/d40/class_solution__coll__graph.map | 6 + d7/d40/class_solution__coll__graph.md5 | 1 + d7/d40/class_solution__coll__graph.svg | 73 + d7/d41/struct_min_heap_node__coll__graph.map | 3 + d7/d41/struct_min_heap_node__coll__graph.md5 | 1 + d7/d41/struct_min_heap_node__coll__graph.svg | 30 + d7/d4c/spiral__print_8cpp__incl.map | 4 + d7/d4c/spiral__print_8cpp__incl.md5 | 1 + d7/d4c/spiral__print_8cpp__incl.svg | 37 + d7/d6a/bisection__method_8cpp.html | 277 ++ d7/d6a/bisection__method_8cpp.js | 8 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.map | 4 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 | 1 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.svg | 37 + d7/d77/class_edge.html | 202 ++ d7/d77/class_edge.js | 15 + .../classstatistics_1_1stats__computer1.html | 340 ++ d7/d7c/classstatistics_1_1stats__computer1.js | 12 + ...57e942d49f4fd70f059f224b4ac07e1_cgraph.map | 5 + ...57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 | 1 + ...57e942d49f4fd70f059f224b4ac07e1_cgraph.svg | 53 + d7/d7f/section.html | 114 + d7/d89/double__factorial_8cpp.html | 193 ++ d7/d89/double__factorial_8cpp.js | 6 + .../power__for__huge__numbers_8cpp__incl.map | 4 + .../power__for__huge__numbers_8cpp__incl.md5 | 1 + .../power__for__huge__numbers_8cpp__incl.svg | 38 + d7/da7/adaline__learning_8cpp__incl.map | 11 + d7/da7/adaline__learning_8cpp__incl.md5 | 1 + d7/da7/adaline__learning_8cpp__incl.svg | 231 ++ d7/da7/adaline__learning_8cpp__incl_org.svg | 143 + d7/dae/decimal__to__binary_8cpp__incl.map | 4 + d7/dae/decimal__to__binary_8cpp__incl.md5 | 1 + d7/dae/decimal__to__binary_8cpp__incl.svg | 37 + d7/dba/cll_8h_source.html | 198 ++ d7/de0/stack_8h_source.html | 246 ++ d8/d01/struct_item-members.html | 113 + d8/d10/structlist.html | 170 + d8/d10/structlist.js | 15 + d8/d13/bubble__sort_8cpp.html | 139 + d8/d13/bubble__sort_8cpp.js | 4 + d8/d38/queue_8h_source.html | 244 ++ d8/d38/structquery-members.html | 114 + ...inverse__fermat__little__theorem_8cpp.html | 280 ++ ...__inverse__fermat__little__theorem_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 67 + d8/d55/class_cycle_check-members.html | 118 + d8/d61/class_trie__coll__graph.map | 5 + d8/d61/class_trie__coll__graph.md5 | 1 + d8/d61/class_trie__coll__graph.svg | 62 + d8/d6c/line__segment__intersection_8cpp.html | 183 ++ d8/d6c/line__segment__intersection_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d8/d77/namespacemachine__learning.html | 626 ++++ d8/d77/namespacemachine__learning.js | 4 + ...d577f5d95b774ae97eb6838852d0df5_cgraph.map | 8 + ...d577f5d95b774ae97eb6838852d0df5_cgraph.md5 | 1 + ...d577f5d95b774ae97eb6838852d0df5_cgraph.svg | 98 + ...61674452869413536ee501f053129a8_cgraph.map | 9 + ...61674452869413536ee501f053129a8_cgraph.md5 | 1 + ...61674452869413536ee501f053129a8_cgraph.svg | 113 + ...4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map | 12 + ...4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5 | 1 + ...4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg | 158 + ...c6a28f40512dbda75ab1a3969248898_cgraph.map | 13 + ...c6a28f40512dbda75ab1a3969248898_cgraph.md5 | 1 + ...c6a28f40512dbda75ab1a3969248898_cgraph.svg | 262 ++ ...8f40512dbda75ab1a3969248898_cgraph_org.svg | 174 ++ ...c731720947b4bc2ab047c141e7d0299_cgraph.map | 13 + ...c731720947b4bc2ab047c141e7d0299_cgraph.md5 | 1 + ...c731720947b4bc2ab047c141e7d0299_cgraph.svg | 261 ++ ...720947b4bc2ab047c141e7d0299_cgraph_org.svg | 173 ++ d8/d8a/exponential__search_8cpp.html | 304 ++ d8/d8a/exponential__search_8cpp.js | 6 + ...f697e2a3b5193324ab84bd4045088f7_cgraph.map | 4 + ...f697e2a3b5193324ab84bd4045088f7_cgraph.md5 | 1 + ...f697e2a3b5193324ab84bd4045088f7_cgraph.svg | 37 + d8/d8e/struct_node-members.html | 117 + d8/d9b/classgraph-members.html | 124 + .../classstatistics_1_1stats__computer2.html | 339 ++ d8/dab/classstatistics_1_1stats__computer2.js | 12 + ...f2e84df4fc386bb3295016ef8fd156e_cgraph.map | 5 + ...f2e84df4fc386bb3295016ef8fd156e_cgraph.md5 | 1 + ...f2e84df4fc386bb3295016ef8fd156e_cgraph.svg | 53 + d8/db9/structcompare-members.html | 112 + d8/dc8/struct_point.html | 221 ++ d8/dc8/struct_point.js | 8 + d8/dcc/namespacestd.html | 2734 +++++++++++++++++ d8/ddf/sieve__of__eratosthenes_8cpp.html | 307 ++ d8/ddf/sieve__of__eratosthenes_8cpp.js | 9 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + ...50a5c87d27cfd3462745b37fb9b0f46_cgraph.map | 4 + ...50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5 | 1 + ...50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg | 37 + d8/dee/avltree_8cpp.html | 736 +++++ d8/dee/avltree_8cpp.js | 15 + ...286388b0743a716145639df3a33e541_cgraph.map | 5 + ...286388b0743a716145639df3a33e541_cgraph.md5 | 1 + ...286388b0743a716145639df3a33e541_cgraph.svg | 52 + ...7cd8a68075fae1c33df41233c1bed6a_cgraph.map | 4 + ...7cd8a68075fae1c33df41233c1bed6a_cgraph.md5 | 1 + ...7cd8a68075fae1c33df41233c1bed6a_cgraph.svg | 37 + ...a457ffec24c9643f2768e7a65e96546_cgraph.map | 5 + ...a457ffec24c9643f2768e7a65e96546_cgraph.md5 | 1 + ...a457ffec24c9643f2768e7a65e96546_cgraph.svg | 52 + ...4a66d8b0c2b0d626aea45977e358c83_cgraph.map | 4 + ...4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 | 1 + ...4a66d8b0c2b0d626aea45977e358c83_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 9 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 112 + d9/d00/factorial_8cpp.html | 189 ++ d9/d00/factorial_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d9/d02/linear__search_8cpp.html | 240 ++ d9/d02/linear__search_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d9/d03/namespacestring__search.html | 554 ++++ ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.map | 7 + ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 | 1 + ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg | 83 + ...6a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map | 5 + ...6a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5 | 1 + ...6a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg | 59 + ...422aab133d4ed5e5d6022a7f701271f_cgraph.map | 4 + ...422aab133d4ed5e5d6022a7f701271f_cgraph.md5 | 1 + ...422aab133d4ed5e5d6022a7f701271f_cgraph.svg | 38 + ...b2cd81064717aedd62bfb096b1a73d8_cgraph.map | 5 + ...b2cd81064717aedd62bfb096b1a73d8_cgraph.md5 | 1 + ...b2cd81064717aedd62bfb096b1a73d8_cgraph.svg | 53 + d9/d1d/structqueue-members.html | 125 + ...smachine__learning_1_1adaline-members.html | 121 + d9/d24/poisson__dist_8cpp.html | 375 +++ d9/d24/poisson__dist_8cpp.js | 9 + ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.map | 6 + ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 | 1 + ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.svg | 67 + ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.map | 7 + ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 | 1 + ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg | 82 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 11 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 148 + d9/d28/class_queue__coll__graph.map | 4 + d9/d28/class_queue__coll__graph.md5 | 1 + d9/d28/class_queue__coll__graph.svg | 50 + d9/d49/kohonen__som__trace_8cpp.html | 662 ++++ d9/d49/kohonen__som__trace_8cpp.js | 16 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 20 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 379 +++ ...86819c7c140a023582b7269e2d0_cgraph_org.svg | 291 ++ ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 20 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 379 +++ ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg | 291 ++ ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 30 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 589 ++++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 501 +++ ...12b7afa156306b1f8788643c91a1c60_cgraph.map | 4 + ...12b7afa156306b1f8788643c91a1c60_cgraph.md5 | 1 + ...12b7afa156306b1f8788643c91a1c60_cgraph.svg | 37 + ...d0455dd5c30adda100e95f0423c786e_cgraph.map | 21 + ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 | 1 + ...d0455dd5c30adda100e95f0423c786e_cgraph.svg | 394 +++ ...5dd5c30adda100e95f0423c786e_cgraph_org.svg | 306 ++ ...ab8c79ffb674a63f151f282faeb723b_cgraph.map | 5 + ...ab8c79ffb674a63f151f282faeb723b_cgraph.md5 | 1 + ...ab8c79ffb674a63f151f282faeb723b_cgraph.svg | 52 + ...47fb569e63648bd76e7edfdacc02dbd_cgraph.map | 4 + ...47fb569e63648bd76e7edfdacc02dbd_cgraph.md5 | 1 + ...47fb569e63648bd76e7edfdacc02dbd_cgraph.svg | 37 + d9/d57/structtrie__coll__graph.map | 3 + d9/d57/structtrie__coll__graph.md5 | 1 + d9/d57/structtrie__coll__graph.svg | 29 + d9/d5d/extended__euclid__algorithm_8cpp.html | 372 +++ d9/d5d/extended__euclid__algorithm_8cpp.js | 7 + ...792ac7c33aaf26b860ab55f5652ab25_cgraph.map | 5 + ...792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 | 1 + ...792ac7c33aaf26b860ab55f5652ab25_cgraph.svg | 52 + ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map | 4 + ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 | 1 + ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg | 37 + d9/d66/group__machine__learning.html | 432 +++ d9/d66/group__machine__learning.js | 11 + ...c606bc85a3e9fd9d010f874ad760336_cgraph.map | 6 + ...c606bc85a3e9fd9d010f874ad760336_cgraph.md5 | 1 + ...c606bc85a3e9fd9d010f874ad760336_cgraph.svg | 67 + ...2699c805c19a6cc47a937a6f3378afa_cgraph.map | 6 + ...2699c805c19a6cc47a937a6f3378afa_cgraph.md5 | 1 + ...2699c805c19a6cc47a937a6f3378afa_cgraph.svg | 67 + ...53c14440b2b2dd3172c66afc5c2f63f_cgraph.map | 7 + ...53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5 | 1 + ...53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg | 82 + d9/d69/median__search_8cpp.html | 274 ++ d9/d69/median__search_8cpp.js | 6 + ...a66390d0e407dce4fcbf63a169c6c8f_cgraph.map | 7 + ...a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5 | 1 + ...a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg | 82 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 11 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 142 + d9/d78/factorial_8cpp__incl.map | 4 + d9/d78/factorial_8cpp__incl.md5 | 1 + d9/d78/factorial_8cpp__incl.svg | 37 + d9/d7d/primality__test_8cpp__incl.map | 4 + d9/d7d/primality__test_8cpp__incl.md5 | 1 + d9/d7d/primality__test_8cpp__incl.svg | 37 + d9/d89/fibonacci_8cpp.html | 168 + d9/d89/fibonacci_8cpp.js | 5 + d9/d90/struct_btree.html | 134 + d9/d90/struct_btree.js | 6 + ...e__force__string__searching_8cpp__incl.map | 6 + ...e__force__string__searching_8cpp__incl.md5 | 1 + ...e__force__string__searching_8cpp__incl.svg | 68 + d9/dd7/interpolation__search_8cpp.html | 250 ++ d9/dd7/interpolation__search_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d9/dd9/bisection__method_8cpp__incl.map | 6 + d9/dd9/bisection__method_8cpp__incl.md5 | 1 + d9/dd9/bisection__method_8cpp__incl.svg | 68 + d9/ddb/tower__of__hanoi_8cpp__incl.map | 4 + d9/ddb/tower__of__hanoi_8cpp__incl.md5 | 1 + d9/ddb/tower__of__hanoi_8cpp__incl.svg | 37 + d9/dee/classdouble__linked__list.html | 134 + d9/dee/classdouble__linked__list.js | 9 + d9/dfd/primes__up__to__billion_8cpp__incl.map | 5 + d9/dfd/primes__up__to__billion_8cpp__incl.md5 | 1 + d9/dfd/primes__up__to__billion_8cpp__incl.svg | 52 + da/d23/eulers__totient__function_8cpp.html | 187 ++ da/d23/eulers__totient__function_8cpp.js | 5 + da/d24/sqrt__double_8cpp.html | 214 ++ da/d24/sqrt__double_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + da/d35/sieve__of__eratosthenes_8cpp__incl.map | 4 + da/d35/sieve__of__eratosthenes_8cpp__incl.md5 | 1 + da/d35/sieve__of__eratosthenes_8cpp__incl.svg | 37 + ...non__recursive__merge__sort_8cpp__incl.map | 6 + ...non__recursive__merge__sort_8cpp__incl.md5 | 1 + ...non__recursive__merge__sort_8cpp__incl.svg | 68 + da/d7b/primality__test_8cpp.html | 213 ++ da/d7b/primality__test_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + da/d8a/paranthesis__matching_8cpp__incl.map | 5 + da/d8a/paranthesis__matching_8cpp__incl.md5 | 1 + da/d8a/paranthesis__matching_8cpp__incl.svg | 53 + da/d9a/class_graph.html | 581 ++++ da/d9a/class_graph.js | 45 + da/d9a/palindrome__of__number_8cpp.html | 181 ++ da/d9a/palindrome__of__number_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + ...hine__learning_1_1adaline__coll__graph.map | 4 + ...hine__learning_1_1adaline__coll__graph.md5 | 1 + ...hine__learning_1_1adaline__coll__graph.svg | 38 + da/dd9/happy__number_8cpp__incl.map | 4 + da/dd9/happy__number_8cpp__incl.md5 | 1 + da/dd9/happy__number_8cpp__incl.svg | 37 + da/de7/decimal__to__hexadecimal_8cpp.html | 182 ++ da/de7/decimal__to__hexadecimal_8cpp.js | 4 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.map | 4 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.md5 | 1 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.svg | 37 + da/df2/durand__kerner__roots_8cpp.html | 586 ++++ da/df2/durand__kerner__roots_8cpp.js | 12 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 17 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 232 ++ ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 17 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 232 ++ ...1637ff89e55ca749993d3e84b95d153_cgraph.map | 6 + ...1637ff89e55ca749993d3e84b95d153_cgraph.md5 | 1 + ...1637ff89e55ca749993d3e84b95d153_cgraph.svg | 67 + ...38b9cfd2a39d856e0feba3b5d241ded_cgraph.map | 15 + ...38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5 | 1 + ...38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg | 202 ++ da/dfd/buzz__number_8cpp__incl.map | 4 + da/dfd/buzz__number_8cpp__incl.md5 | 1 + da/dfd/buzz__number_8cpp__incl.svg | 37 + db/d07/spiral__print_8cpp.html | 308 ++ db/d07/spiral__print_8cpp.js | 6 + db/d0d/prime__factorization_8cpp.html | 330 ++ db/d0d/prime__factorization_8cpp.js | 9 + ...ece0145fb29a5cf48378c23dde2da46_cgraph.map | 4 + ...ece0145fb29a5cf48378c23dde2da46_cgraph.md5 | 1 + ...ece0145fb29a5cf48378c23dde2da46_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 8 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 97 + ...fe577b9bce8f604f5e2f861c63c7099_cgraph.map | 4 + ...fe577b9bce8f604f5e2f861c63c7099_cgraph.md5 | 1 + ...fe577b9bce8f604f5e2f861c63c7099_cgraph.svg | 37 + db/d30/fast__power_8cpp__incl.map | 9 + db/d30/fast__power_8cpp__incl.md5 | 1 + db/d30/fast__power_8cpp__incl.svg | 112 + db/d3c/tower__of__hanoi_8cpp.html | 350 +++ db/d3c/tower__of__hanoi_8cpp.js | 8 + ...037f72a5eac476535a6cfbbcb965417_cgraph.map | 5 + ...037f72a5eac476535a6cfbbcb965417_cgraph.md5 | 1 + ...037f72a5eac476535a6cfbbcb965417_cgraph.svg | 52 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 73 + db/d51/fibonacci__fast_8cpp__incl.map | 6 + db/d51/fibonacci__fast_8cpp__incl.md5 | 1 + db/d51/fibonacci__fast_8cpp__incl.svg | 67 + db/d66/struct_item.html | 125 + db/d66/struct_item.js | 5 + db/d82/classlarge__number.html | 989 ++++++ db/d82/classlarge__number.js | 26 + ...0119a83839e65962621b73df46a5337_cgraph.map | 4 + ...0119a83839e65962621b73df46a5337_cgraph.md5 | 1 + ...0119a83839e65962621b73df46a5337_cgraph.svg | 38 + ...305a82e7b372617419337b2d2119c7d_cgraph.map | 4 + ...305a82e7b372617419337b2d2119c7d_cgraph.md5 | 1 + ...305a82e7b372617419337b2d2119c7d_cgraph.svg | 37 + ...f5571e66305cf68bb8283e4aeda58bc_cgraph.map | 7 + ...f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 | 1 + ...f5571e66305cf68bb8283e4aeda58bc_cgraph.svg | 82 + ...0c436d1a1c5e3795d6177d3815ad615_cgraph.map | 4 + ...0c436d1a1c5e3795d6177d3815ad615_cgraph.md5 | 1 + ...0c436d1a1c5e3795d6177d3815ad615_cgraph.svg | 37 + ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map | 6 + ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 | 1 + ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg | 68 + ...1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map | 8 + ...1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5 | 1 + ...1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg | 185 ++ ...e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg | 97 + ...4598f1f2794b5e17e10c25e0501e41a_cgraph.map | 5 + ...4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 | 1 + ...4598f1f2794b5e17e10c25e0501e41a_cgraph.svg | 53 + ...530d90830d385c76973658ff3214f98_cgraph.map | 5 + ...530d90830d385c76973658ff3214f98_cgraph.md5 | 1 + ...530d90830d385c76973658ff3214f98_cgraph.svg | 52 + db/d8b/struct_node.html | 149 + db/d8b/struct_node.js | 9 + db/d8f/struct_btree__coll__graph.map | 3 + db/d8f/struct_btree__coll__graph.md5 | 1 + db/d8f/struct_btree__coll__graph.svg | 30 + db/d93/check__prime_8cpp.html | 227 ++ db/d93/check__prime_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + db/dd3/ode__forward__euler_8cpp.html | 414 +++ db/dd3/ode__forward__euler_8cpp.js | 9 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 16 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 241 ++ ...13517b8e5de1b75592052db7f7e237f_cgraph.map | 10 + ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 | 1 + ...13517b8e5de1b75592052db7f7e237f_cgraph.svg | 127 + ...3adf7b092a87868917ee5fb4255192b_cgraph.map | 5 + ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 | 1 + ...3adf7b092a87868917ee5fb4255192b_cgraph.svg | 52 + db/dd4/structlist__coll__graph.map | 3 + db/dd4/structlist__coll__graph.md5 | 1 + db/dd4/structlist__coll__graph.svg | 29 + db/df3/happy__number_8cpp.html | 206 ++ db/df3/happy__number_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + dc/d1a/pascal__triangle_8cpp.html | 291 ++ dc/d1a/pascal__triangle_8cpp.js | 6 + ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map | 5 + ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 | 1 + ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg | 52 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 88 + dc/d37/lu__decompose_8cpp__incl.map | 7 + dc/d37/lu__decompose_8cpp__incl.md5 | 1 + dc/d37/lu__decompose_8cpp__incl.svg | 83 + ...inary__least__squares__regressor_8cpp.html | 994 ++++++ ...rdinary__least__squares__regressor_8cpp.js | 18 + ...1be3fe36e76b87d5616ff8e7918cd24_cgraph.map | 5 + ...1be3fe36e76b87d5616ff8e7918cd24_cgraph.md5 | 1 + ...1be3fe36e76b87d5616ff8e7918cd24_cgraph.svg | 52 + ...8ff1d954e9b7de93eb20e2dd101a045_cgraph.map | 8 + ...8ff1d954e9b7de93eb20e2dd101a045_cgraph.md5 | 1 + ...8ff1d954e9b7de93eb20e2dd101a045_cgraph.svg | 97 + ...4d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map | 5 + ...4d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5 | 1 + ...4d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg | 52 + ...7249e31221231cf3aaf3cfd870372d0_cgraph.map | 5 + ...7249e31221231cf3aaf3cfd870372d0_cgraph.md5 | 1 + ...7249e31221231cf3aaf3cfd870372d0_cgraph.svg | 52 + ...8ab8f75d981088369b89b8be2182483_cgraph.map | 5 + ...8ab8f75d981088369b89b8be2182483_cgraph.md5 | 1 + ...8ab8f75d981088369b89b8be2182483_cgraph.svg | 52 + ...8eb5807f21b783c341cab402ced6732_cgraph.map | 7 + ...8eb5807f21b783c341cab402ced6732_cgraph.md5 | 1 + ...8eb5807f21b783c341cab402ced6732_cgraph.svg | 82 + ...b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map | 4 + ...b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5 | 1 + ...b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg | 37 + ...799b4cec1681219887d89d037cfab50_cgraph.map | 6 + ...799b4cec1681219887d89d037cfab50_cgraph.md5 | 1 + ...799b4cec1681219887d89d037cfab50_cgraph.svg | 67 + ...6171f4db68a5e50ae0f3500a63acd26_cgraph.map | 4 + ...6171f4db68a5e50ae0f3500a63acd26_cgraph.md5 | 1 + ...6171f4db68a5e50ae0f3500a63acd26_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 10 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 133 + ...cef32c2a4f39a3f7398949256d180a6_cgraph.map | 4 + ...cef32c2a4f39a3f7398949256d180a6_cgraph.md5 | 1 + ...cef32c2a4f39a3f7398949256d180a6_cgraph.svg | 37 + ...decimal__to__roman__numeral_8cpp__incl.map | 7 + ...decimal__to__roman__numeral_8cpp__incl.md5 | 1 + ...decimal__to__roman__numeral_8cpp__incl.svg | 83 + dc/d5f/qr__decompose_8h__dep__incl.map | 5 + dc/d5f/qr__decompose_8h__dep__incl.md5 | 1 + dc/d5f/qr__decompose_8h__dep__incl.svg | 55 + dc/d93/trie__modern_8cpp.html | 171 ++ dc/d93/trie__modern_8cpp.js | 6 + dc/db5/text__search_8cpp.html | 189 ++ dc/db5/text__search_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + dc/dc5/ode__forward__euler_8cpp__incl.map | 8 + dc/dc5/ode__forward__euler_8cpp__incl.md5 | 1 + dc/dc5/ode__forward__euler_8cpp__incl.svg | 98 + dc/dc5/paranthesis__matching_8cpp.html | 227 ++ dc/dc5/paranthesis__matching_8cpp.js | 10 + dc/de0/fibonacci__large_8cpp__incl.map | 12 + dc/de0/fibonacci__large_8cpp__incl.md5 | 1 + dc/de0/fibonacci__large_8cpp__incl.svg | 169 + dc/de2/false__position_8cpp__incl.map | 7 + dc/de2/false__position_8cpp__incl.md5 | 1 + dc/de2/false__position_8cpp__incl.svg | 83 + dc/dfe/ternary__search_8cpp.html | 461 +++ dc/dfe/ternary__search_8cpp.js | 11 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 8 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 97 + ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.map | 6 + ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 | 1 + ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.svg | 67 + dd/d00/class_queue-members.html | 118 + dd/d0e/double__factorial_8cpp__incl.map | 5 + dd/d0e/double__factorial_8cpp__incl.md5 | 1 + dd/d0e/double__factorial_8cpp__incl.svg | 52 + dd/d0f/text__search_8cpp__incl.map | 6 + dd/d0f/text__search_8cpp__incl.md5 | 1 + dd/d0f/text__search_8cpp__incl.svg | 67 + dd/d1b/structquery.html | 128 + dd/d1b/structquery.js | 6 + dd/d29/false__position_8cpp.html | 275 ++ dd/d29/false__position_8cpp.js | 8 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.map | 4 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 | 1 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.svg | 37 + dd/d2f/class_trie.html | 414 +++ dd/d2f/class_trie.js | 12 + ...5216ffc56cb9f8cede982cecb872af4_cgraph.map | 6 + ...5216ffc56cb9f8cede982cecb872af4_cgraph.md5 | 1 + ...5216ffc56cb9f8cede982cecb872af4_cgraph.svg | 67 + dd/d30/matrix__exponentiation_8cpp__incl.map | 5 + dd/d30/matrix__exponentiation_8cpp__incl.md5 | 1 + dd/d30/matrix__exponentiation_8cpp__incl.svg | 52 + dd/d3b/struct_entry.html | 137 + dd/d3b/struct_entry.js | 7 + dd/d4f/class_solution.html | 157 + dd/d4f/class_solution.js | 11 + dd/d51/classstack-members.html | 122 + dd/d65/lu__decompose_8cpp.html | 365 +++ dd/d65/lu__decompose_8cpp.js | 6 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 8 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 97 + ...8eb5807f21b783c341cab402ced6732_cgraph.map | 7 + ...8eb5807f21b783c341cab402ced6732_cgraph.md5 | 1 + ...8eb5807f21b783c341cab402ced6732_cgraph.svg | 82 + dd/d75/structqueue__coll__graph.map | 4 + dd/d75/structqueue__coll__graph.md5 | 1 + dd/d75/structqueue__coll__graph.svg | 49 + dd/d7a/classdouble__linked__list-members.html | 117 + .../classstack__linked_list__coll__graph.map | 4 + .../classstack__linked_list__coll__graph.md5 | 1 + .../classstack__linked_list__coll__graph.svg | 46 + dd/d82/large__number_8h__incl.map | 10 + dd/d82/large__number_8h__incl.md5 | 1 + dd/d82/large__number_8h__incl.svg | 127 + dd/d86/shell__sort2_8cpp__incl.map | 9 + dd/d86/shell__sort2_8cpp__incl.md5 | 1 + dd/d86/shell__sort2_8cpp__incl.svg | 112 + dd/d9b/classgraph.html | 173 ++ dd/d9b/classgraph.js | 16 + dd/da0/todo.html | 131 + .../struct_segment_intersection-members.html | 114 + ...line__segment__intersection_8cpp__incl.map | 5 + ...line__segment__intersection_8cpp__incl.md5 | 1 + ...line__segment__intersection_8cpp__incl.svg | 53 + dd/df4/structlca.html | 156 + dd/df4/structlca.js | 12 + dd/df5/poisson__dist_8cpp__incl.map | 5 + dd/df5/poisson__dist_8cpp__incl.md5 | 1 + dd/df5/poisson__dist_8cpp__incl.svg | 53 + de/d36/binary__exponent_8cpp__incl.map | 4 + de/d36/binary__exponent_8cpp__incl.md5 | 1 + de/d36/binary__exponent_8cpp__incl.svg | 37 + de/d47/string__fibonacci_8cpp.html | 295 ++ de/d47/string__fibonacci_8cpp.js | 6 + ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.map | 4 + ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 | 1 + ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + de/d48/struct_trie_1_1_trie_node.html | 133 + de/d48/struct_trie_1_1_trie_node.js | 5 + .../eulers__totient__function_8cpp__incl.map | 5 + .../eulers__totient__function_8cpp__incl.md5 | 1 + .../eulers__totient__function_8cpp__incl.svg | 53 + de/d69/knuth__morris__pratt_8cpp__incl.map | 6 + de/d69/knuth__morris__pratt_8cpp__incl.md5 | 1 + de/d69/knuth__morris__pratt_8cpp__incl.svg | 68 + de/d6a/knuth__morris__pratt_8cpp.html | 195 ++ de/d6a/knuth__morris__pratt_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 89 + de/d6c/palindrome__of__number_8cpp__incl.map | 6 + de/d6c/palindrome__of__number_8cpp__incl.md5 | 1 + de/d6c/palindrome__of__number_8cpp__incl.svg | 68 + de/d75/qr__eigen__values_8cpp.html | 485 +++ de/d75/qr__eigen__values_8cpp.js | 10 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 11 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 231 ++ ...86819c7c140a023582b7269e2d0_cgraph_org.svg | 143 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 11 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 231 ++ ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg | 143 + ...3cb0a68c36aa26fd599c7c66da86ed7_cgraph.map | 4 + ...3cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5 | 1 + ...3cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg | 37 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 17 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 339 ++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 251 ++ de/d7c/struct_trie_1_1_trie_node-members.html | 113 + de/d85/decimal__to__roman__numeral_8cpp.html | 322 ++ de/d85/decimal__to__roman__numeral_8cpp.js | 7 + ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map | 4 + ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 | 1 + ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg | 37 + ...14743638eff1336f835310049aef979_cgraph.map | 4 + ...14743638eff1336f835310049aef979_cgraph.md5 | 1 + ...14743638eff1336f835310049aef979_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 73 + de/d8a/class_trie-members.html | 119 + de/d91/class_queue___array-members.html | 119 + de/d91/structlist-members.html | 123 + de/d9b/prime__numbers_8cpp.html | 211 ++ de/d9b/prime__numbers_8cpp.js | 5 + ...b91f208e8365c95a295cfe3e67df5c3_cgraph.map | 4 + ...b91f208e8365c95a295cfe3e67df5c3_cgraph.md5 | 1 + ...b91f208e8365c95a295cfe3e67df5c3_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + de/db2/quick__sort_8cpp__incl.map | 5 + de/db2/quick__sort_8cpp__incl.md5 | 1 + de/db2/quick__sort_8cpp__incl.svg | 52 + de/db5/class_edge-members.html | 123 + de/dc3/binaryheap_8cpp.html | 138 + de/dc3/binaryheap_8cpp.js | 5 + de/dc8/classlarge__number-members.html | 134 + de/dcf/binary__exponent_8cpp.html | 265 ++ de/dcf/binary__exponent_8cpp.js | 6 + de/dd3/newton__raphson__method_8cpp.html | 281 ++ de/dd3/newton__raphson__method_8cpp.js | 8 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.map | 4 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 | 1 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.svg | 37 + ...d3f7f41977394680af6ebbed96f3386_cgraph.map | 4 + ...d3f7f41977394680af6ebbed96f3386_cgraph.md5 | 1 + ...d3f7f41977394680af6ebbed96f3386_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + de/de4/fibonacci__large_8cpp.html | 175 ++ de/de4/fibonacci__large_8cpp.js | 5 + df/d06/decimal__to__binary_8cpp.html | 217 ++ df/d06/decimal__to__binary_8cpp.js | 6 + ...0df57491019f0ac39b492740fb388f7_cgraph.map | 4 + ...0df57491019f0ac39b492740fb388f7_cgraph.md5 | 1 + ...0df57491019f0ac39b492740fb388f7_cgraph.svg | 37 + ...240f2e79074a2a248395258aebbfa11_cgraph.map | 4 + ...240f2e79074a2a248395258aebbfa11_cgraph.md5 | 1 + ...240f2e79074a2a248395258aebbfa11_cgraph.svg | 37 + df/d0f/fibonacci_8cpp__incl.map | 5 + df/d0f/fibonacci_8cpp__incl.md5 | 1 + df/d0f/fibonacci_8cpp__incl.svg | 52 + df/d27/class_bit.html | 157 + df/d27/class_bit.js | 11 + df/d39/interpolation__search2_8cpp.html | 231 ++ df/d39/interpolation__search2_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + df/d3c/exponential__search_8cpp__incl.map | 7 + df/d3c/exponential__search_8cpp__incl.md5 | 1 + df/d3c/exponential__search_8cpp__incl.svg | 83 + df/d86/rabin__karp_8cpp__incl.map | 7 + df/d86/rabin__karp_8cpp__incl.md5 | 1 + df/d86/rabin__karp_8cpp__incl.svg | 82 + df/dc8/successive__approximation_8cpp.html | 246 ++ df/dc8/successive__approximation_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + df/dd4/stairs__pattern_8cpp__incl.map | 4 + df/dd4/stairs__pattern_8cpp__incl.md5 | 1 + df/dd4/stairs__pattern_8cpp__incl.svg | 37 + df/dd5/binary__search_8cpp.html | 257 ++ df/dd5/binary__search_8cpp.js | 5 + ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.map | 5 + ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 | 1 + ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg | 52 + df/dd7/structlinkedlist-members.html | 113 + df/ddc/struct_node__coll__graph.map | 3 + df/ddc/struct_node__coll__graph.md5 | 1 + df/ddc/struct_node__coll__graph.svg | 29 + df/def/power__for__huge__numbers_8cpp.html | 327 ++ df/def/power__for__huge__numbers_8cpp.js | 7 + ...249a2af508aa94266023ce8aa81426f_cgraph.map | 4 + ...249a2af508aa94266023ce8aa81426f_cgraph.md5 | 1 + ...249a2af508aa94266023ce8aa81426f_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + dir_074119ce3a874b57120c49a0cc4bb5ad.html | 109 + dir_0eaa691bd54ab0922ca7f50599de6d22.html | 109 + dir_12552d7fa429bf94a2e32e5cf39f7e69.html | 109 + dir_19b2bf9199a15c634a08b1ede1dd896a.html | 143 + dir_19b2bf9199a15c634a08b1ede1dd896a.js | 13 + dir_296d53ceaeaa7e099814a6def439fe8a.html | 190 ++ dir_296d53ceaeaa7e099814a6def439fe8a.js | 31 + dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html | 131 + dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js | 11 + dir_3343723ae086de42ee4ca9774da3a13f.html | 122 + dir_3343723ae086de42ee4ca9774da3a13f.js | 6 + dir_35422be6552f1b3672c1b6c4aba2da64.html | 109 + dir_73a3cc5065b223eb41b02873c0e19f0e.html | 122 + dir_73a3cc5065b223eb41b02873c0e19f0e.js | 6 + dir_82e494173a87936756866de2fa774307.html | 125 + dir_82e494173a87936756866de2fa774307.js | 7 + dir_8a20dd5bfd5341a725342bf72b6b686f.html | 109 + dir_9510827d0b234b3cc54b29892f217477.html | 163 + dir_9510827d0b234b3cc54b29892f217477.js | 20 + dir_9c6faab82c22511b50177aa2e38e2780.html | 155 + dir_9c6faab82c22511b50177aa2e38e2780.js | 17 + dir_bb1b521853a9c46347182a9d10420771.html | 124 + dir_bb1b521853a9c46347182a9d10420771.js | 7 + dir_c11585dfcef32a26e29098facab6c144.html | 109 + dir_e3380d2178455503f266746fb14246a5.html | 116 + dir_e3380d2178455503f266746fb14246a5.js | 4 + dir_ece9b94c107bbaa1dd68197a8c9983b9.html | 109 + dir_f1797d0c2a0a12033e7d74efffeb14e1.html | 109 + dir_f1797d0c2a0a12033e7d74efffeb14e1.js | 4 + doc.png | Bin 0 -> 746 bytes doxygen.css | 1730 +++++++++++ doxygen.png | Bin 0 -> 3779 bytes dynsections.js | 121 + files.html | 213 ++ files_dup.js | 13 + folderclosed.png | Bin 0 -> 616 bytes folderopen.png | Bin 0 -> 597 bytes functions.html | 447 +++ functions_func.html | 364 +++ functions_rela.html | 123 + functions_vars.html | 154 + globals.html | 114 + globals_a.html | 135 + globals_b.html | 142 + globals_c.html | 132 + globals_d.html | 123 + globals_defs.html | 151 + globals_dup.js | 24 + globals_e.html | 134 + globals_f.html | 154 + globals_func.html | 111 + globals_func.js | 23 + globals_func_a.html | 123 + globals_func_b.html | 142 + globals_func_c.html | 132 + globals_func_d.html | 120 + globals_func_e.html | 131 + globals_func_f.html | 148 + globals_func_g.html | 139 + globals_func_h.html | 117 + globals_func_i.html | 141 + globals_func_j.html | 111 + globals_func_l.html | 126 + globals_func_m.html | 211 ++ globals_func_n.html | 114 + globals_func_o.html | 127 + globals_func_p.html | 159 + globals_func_r.html | 114 + globals_func_s.html | 156 + globals_func_t.html | 179 ++ globals_func_u.html | 111 + globals_g.html | 139 + globals_h.html | 123 + globals_i.html | 147 + globals_j.html | 111 + globals_k.html | 111 + globals_l.html | 135 + globals_m.html | 230 ++ globals_n.html | 117 + globals_o.html | 127 + globals_p.html | 171 ++ globals_r.html | 114 + globals_s.html | 159 + globals_t.html | 185 ++ globals_type.html | 112 + globals_u.html | 111 + globals_vars.html | 149 + graph_legend.html | 168 + graph_legend.md5 | 1 + graph_legend.svg | 117 + index.html | 118 + jquery.js | 35 + menu.js | 51 + menudata.js | 133 + modules.html | 114 + modules.js | 5 + namespacemembers.html | 172 ++ namespacemembers_func.html | 172 ++ namespaces.html | 118 + namespaces_dup.js | 9 + nav_f.png | Bin 0 -> 153 bytes nav_g.png | Bin 0 -> 95 bytes nav_h.png | Bin 0 -> 98 bytes navtree.css | 146 + navtree.js | 546 ++++ navtreedata.js | 109 + navtreeindex0.js | 253 ++ navtreeindex1.js | 253 ++ navtreeindex2.js | 253 ++ navtreeindex3.js | 174 ++ open.png | Bin 0 -> 123 bytes pages.html | 116 + resize.js | 140 + search/all_0.html | 36 + search/all_0.js | 7 + search/all_1.html | 36 + search/all_1.js | 96 + search/all_10.html | 36 + search/all_10.js | 96 + search/all_11.html | 36 + search/all_11.js | 18 + search/all_12.html | 36 + search/all_12.js | 97 + search/all_13.html | 36 + search/all_13.js | 201 ++ search/all_14.html | 36 + search/all_14.js | 96 + search/all_15.html | 36 + search/all_15.js | 62 + search/all_16.html | 36 + search/all_16.js | 37 + search/all_17.html | 36 + search/all_17.js | 82 + search/all_18.html | 36 + search/all_18.js | 7 + search/all_19.html | 36 + search/all_19.js | 7 + search/all_1a.html | 36 + search/all_1a.js | 5 + search/all_1b.html | 36 + search/all_1b.js | 94 + search/all_2.html | 36 + search/all_2.js | 82 + search/all_3.html | 36 + search/all_3.js | 91 + search/all_4.html | 36 + search/all_4.js | 90 + search/all_5.html | 36 + search/all_5.js | 65 + search/all_6.html | 36 + search/all_6.js | 118 + search/all_7.html | 36 + search/all_7.js | 60 + search/all_8.html | 36 + search/all_8.js | 25 + search/all_9.html | 36 + search/all_9.js | 176 ++ search/all_a.html | 36 + search/all_a.js | 8 + search/all_b.html | 36 + search/all_b.js | 16 + search/all_c.html | 36 + search/all_c.js | 66 + search/all_d.html | 36 + search/all_d.js | 101 + search/all_e.html | 36 + search/all_e.js | 60 + search/all_f.html | 36 + search/all_f.js | 66 + search/classes_0.html | 36 + search/classes_0.js | 21 + search/classes_1.html | 36 + search/classes_1.js | 43 + search/classes_10.html | 36 + search/classes_10.js | 6 + search/classes_11.html | 36 + search/classes_11.js | 42 + search/classes_12.html | 36 + search/classes_12.js | 43 + search/classes_13.html | 36 + search/classes_13.js | 25 + search/classes_14.html | 36 + search/classes_14.js | 36 + search/classes_15.html | 36 + search/classes_15.js | 14 + search/classes_16.html | 36 + search/classes_16.js | 34 + search/classes_17.html | 36 + search/classes_17.js | 5 + search/classes_18.html | 36 + search/classes_18.js | 4 + search/classes_2.html | 36 + search/classes_2.js | 37 + search/classes_3.html | 36 + search/classes_3.js | 18 + search/classes_4.html | 36 + search/classes_4.js | 20 + search/classes_5.html | 36 + search/classes_5.js | 19 + search/classes_6.html | 36 + search/classes_6.js | 9 + search/classes_7.html | 36 + search/classes_7.js | 8 + search/classes_8.html | 36 + search/classes_8.js | 101 + search/classes_9.html | 36 + search/classes_9.js | 4 + search/classes_a.html | 36 + search/classes_a.js | 5 + search/classes_b.html | 36 + search/classes_b.js | 20 + search/classes_c.html | 36 + search/classes_c.js | 39 + search/classes_d.html | 36 + search/classes_d.js | 20 + search/classes_e.html | 36 + search/classes_e.js | 15 + search/classes_f.html | 36 + search/classes_f.js | 20 + search/close.png | Bin 0 -> 273 bytes search/defines_0.html | 36 + search/defines_0.js | 4 + search/defines_1.html | 36 + search/defines_1.js | 5 + search/defines_2.html | 36 + search/defines_2.js | 4 + search/defines_3.html | 36 + search/defines_3.js | 4 + search/defines_4.html | 36 + search/defines_4.js | 5 + search/defines_5.html | 36 + search/defines_5.js | 7 + search/defines_6.html | 36 + search/defines_6.js | 5 + search/files_0.html | 36 + search/files_0.js | 6 + search/files_1.html | 36 + search/files_1.js | 13 + search/files_10.html | 36 + search/files_10.js | 7 + search/files_11.html | 36 + search/files_11.js | 5 + search/files_12.html | 36 + search/files_12.js | 12 + search/files_13.html | 36 + search/files_13.js | 7 + search/files_14.html | 36 + search/files_14.js | 4 + search/files_2.html | 36 + search/files_2.js | 4 + search/files_3.html | 36 + search/files_3.js | 8 + search/files_4.html | 36 + search/files_4.js | 6 + search/files_5.html | 36 + search/files_5.js | 10 + search/files_6.html | 36 + search/files_6.js | 7 + search/files_7.html | 36 + search/files_7.js | 5 + search/files_8.html | 36 + search/files_8.js | 5 + search/files_9.html | 36 + search/files_9.js | 4 + search/files_a.html | 36 + search/files_a.js | 6 + search/files_b.html | 36 + search/files_b.js | 10 + search/files_c.html | 36 + search/files_c.js | 6 + search/files_d.html | 36 + search/files_d.js | 6 + search/files_e.html | 36 + search/files_e.js | 7 + search/files_f.html | 36 + search/files_f.js | 12 + search/functions_0.html | 36 + search/functions_0.js | 5 + search/functions_1.html | 36 + search/functions_1.js | 77 + search/functions_10.html | 36 + search/functions_10.js | 74 + search/functions_11.html | 36 + search/functions_11.js | 9 + search/functions_12.html | 36 + search/functions_12.js | 72 + search/functions_13.html | 36 + search/functions_13.js | 168 + search/functions_14.html | 36 + search/functions_14.js | 77 + search/functions_15.html | 36 + search/functions_15.js | 41 + search/functions_16.html | 36 + search/functions_16.js | 25 + search/functions_17.html | 36 + search/functions_17.js | 76 + search/functions_18.html | 36 + search/functions_18.js | 6 + search/functions_19.html | 36 + search/functions_19.js | 4 + search/functions_1a.html | 36 + search/functions_1a.js | 4 + search/functions_1b.html | 36 + search/functions_1b.js | 94 + search/functions_2.html | 36 + search/functions_2.js | 59 + search/functions_3.html | 36 + search/functions_3.js | 71 + search/functions_4.html | 36 + search/functions_4.js | 77 + search/functions_5.html | 36 + search/functions_5.js | 52 + search/functions_6.html | 36 + search/functions_6.js | 102 + search/functions_7.html | 36 + search/functions_7.js | 53 + search/functions_8.html | 36 + search/functions_8.js | 16 + search/functions_9.html | 36 + search/functions_9.js | 86 + search/functions_a.html | 36 + search/functions_a.js | 6 + search/functions_b.html | 36 + search/functions_b.js | 11 + search/functions_c.html | 36 + search/functions_c.js | 46 + search/functions_d.html | 36 + search/functions_d.js | 78 + search/functions_e.html | 36 + search/functions_e.js | 48 + search/functions_f.html | 36 + search/functions_f.js | 57 + search/groups_0.html | 36 + search/groups_0.js | 4 + search/groups_1.html | 36 + search/groups_1.js | 4 + search/mag_sel.png | Bin 0 -> 465 bytes search/namespaces_0.html | 36 + search/namespaces_0.js | 4 + search/namespaces_1.html | 36 + search/namespaces_1.js | 4 + search/namespaces_2.html | 36 + search/namespaces_2.js | 12 + search/nomatches.html | 12 + search/pages_0.html | 36 + search/pages_0.js | 4 + search/pages_1.html | 36 + search/pages_1.js | 4 + search/pages_2.html | 36 + search/pages_2.js | 4 + search/pages_3.html | 36 + search/pages_3.js | 5 + search/related_0.html | 36 + search/related_0.js | 8 + search/search.css | 271 ++ search/search.js | 814 +++++ search/search_l.png | Bin 0 -> 567 bytes search/search_m.png | Bin 0 -> 158 bytes search/search_r.png | Bin 0 -> 553 bytes search/searchdata.js | 45 + search/typedefs_0.html | 36 + search/typedefs_0.js | 4 + search/typedefs_1.html | 36 + search/typedefs_1.js | 4 + search/variables_0.html | 36 + search/variables_0.js | 4 + search/variables_1.html | 36 + search/variables_1.js | 6 + search/variables_10.html | 36 + search/variables_10.js | 4 + search/variables_11.html | 36 + search/variables_11.js | 4 + search/variables_12.html | 36 + search/variables_12.js | 4 + search/variables_2.html | 36 + search/variables_2.js | 4 + search/variables_3.html | 36 + search/variables_3.js | 4 + search/variables_4.html | 36 + search/variables_4.js | 4 + search/variables_5.html | 36 + search/variables_5.js | 5 + search/variables_6.html | 36 + search/variables_6.js | 6 + search/variables_7.html | 36 + search/variables_7.js | 4 + search/variables_8.html | 36 + search/variables_8.js | 5 + search/variables_9.html | 36 + search/variables_9.js | 4 + search/variables_a.html | 36 + search/variables_a.js | 4 + search/variables_b.html | 36 + search/variables_b.js | 5 + search/variables_c.html | 36 + search/variables_c.js | 5 + search/variables_d.html | 36 + search/variables_d.js | 5 + search/variables_e.html | 36 + search/variables_e.js | 5 + search/variables_f.html | 36 + search/variables_f.js | 4 + splitbar.png | Bin 0 -> 314 bytes svgpan.js | 323 ++ sync_off.png | Bin 0 -> 853 bytes sync_on.png | Bin 0 -> 845 bytes tab_a.png | Bin 0 -> 142 bytes tab_b.png | Bin 0 -> 169 bytes tab_h.png | Bin 0 -> 177 bytes tab_s.png | Bin 0 -> 184 bytes tabs.css | 1 + 1714 files changed, 114526 insertions(+) create mode 100644 annotated.html create mode 100644 annotated_dup.js create mode 100644 bc_s.png create mode 100644 bdwn.png create mode 100644 classes.html create mode 100644 closed.png create mode 100644 d0/d01/smallest__circle_8cpp.html create mode 100644 d0/d01/smallest__circle_8cpp.js create mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg create mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg create mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg create mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg create mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg create mode 100644 d0/d04/qr__decompose_8h__incl.map create mode 100644 d0/d04/qr__decompose_8h__incl.md5 create mode 100644 d0/d04/qr__decompose_8h__incl.svg create mode 100644 d0/d08/realtime__stats_8cpp.html create mode 100644 d0/d08/realtime__stats_8cpp.js create mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map create mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5 create mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg create mode 100644 d0/d0d/structmst-members.html create mode 100644 d0/d1f/structnode__coll__graph.map create mode 100644 d0/d1f/structnode__coll__graph.md5 create mode 100644 d0/d1f/structnode__coll__graph.svg create mode 100644 d0/d55/classcll-members.html create mode 100644 d0/d77/linear__search_8cpp__incl.map create mode 100644 d0/d77/linear__search_8cpp__incl.md5 create mode 100644 d0/d77/linear__search_8cpp__incl.svg create mode 100644 d0/d78/classstatistics_1_1stats__computer1-members.html create mode 100644 d0/d80/classgraph__coll__graph.map create mode 100644 d0/d80/classgraph__coll__graph.md5 create mode 100644 d0/d80/classgraph__coll__graph.svg create mode 100644 d0/da1/string__fibonacci_8cpp__incl.map create mode 100644 d0/da1/string__fibonacci_8cpp__incl.md5 create mode 100644 d0/da1/string__fibonacci_8cpp__incl.svg create mode 100644 d0/da2/number__of__positive__divisors_8cpp.html create mode 100644 d0/da2/number__of__positive__divisors_8cpp.js create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.map create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5 create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d0/dab/interpolation__search_8cpp__incl.map create mode 100644 d0/dab/interpolation__search_8cpp__incl.md5 create mode 100644 d0/dab/interpolation__search_8cpp__incl.svg create mode 100644 d0/db5/trie__modern_8cpp__incl.map create mode 100644 d0/db5/trie__modern_8cpp__incl.md5 create mode 100644 d0/db5/trie__modern_8cpp__incl.svg create mode 100644 d0/db6/non__recursive__merge__sort_8cpp.html create mode 100644 d0/db6/non__recursive__merge__sort_8cpp.js create mode 100644 d0/db7/smallest__circle_8cpp__incl.map create mode 100644 d0/db7/smallest__circle_8cpp__incl.md5 create mode 100644 d0/db7/smallest__circle_8cpp__incl.svg create mode 100644 d0/dc4/struct_point-members.html create mode 100644 d0/dcc/successive__approximation_8cpp__incl.map create mode 100644 d0/dcc/successive__approximation_8cpp__incl.md5 create mode 100644 d0/dcc/successive__approximation_8cpp__incl.svg create mode 100644 d0/dd1/binaryheap_8cpp__incl.map create mode 100644 d0/dd1/binaryheap_8cpp__incl.md5 create mode 100644 d0/dd1/binaryheap_8cpp__incl.svg create mode 100644 d0/dd2/class_queue___array.html create mode 100644 d0/dd2/class_queue___array.js create mode 100644 d0/dd5/ode__midpoint__euler_8cpp__incl.map create mode 100644 d0/dd5/ode__midpoint__euler_8cpp__incl.md5 create mode 100644 d0/dd5/ode__midpoint__euler_8cpp__incl.svg create mode 100644 d0/de2/gaussian__elimination_8cpp.html create mode 100644 d0/de2/gaussian__elimination_8cpp.js create mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d0/dfc/sqrt__double_8cpp__incl.map create mode 100644 d0/dfc/sqrt__double_8cpp__incl.md5 create mode 100644 d0/dfc/sqrt__double_8cpp__incl.svg create mode 100644 d0/dff/structlinkedlist.html create mode 100644 d0/dff/structlinkedlist.js create mode 100644 d1/d06/ternary__search_8cpp__incl.map create mode 100644 d1/d06/ternary__search_8cpp__incl.md5 create mode 100644 d1/d06/ternary__search_8cpp__incl.svg create mode 100644 d1/d07/class_solution-members.html create mode 100644 d1/d11/gcd__of__n__numbers_8cpp.html create mode 100644 d1/d11/gcd__of__n__numbers_8cpp.js create mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/d1d/class_graph-members.html create mode 100644 d1/d1d/pascal__triangle_8cpp__incl.map create mode 100644 d1/d1d/pascal__triangle_8cpp__incl.md5 create mode 100644 d1/d1d/pascal__triangle_8cpp__incl.svg create mode 100644 d1/d21/quick__sort_8cpp.html create mode 100644 d1/d21/quick__sort_8cpp.js create mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/d4b/ordinary__least__squares__regressor_8cpp__incl.map create mode 100644 d1/d4b/ordinary__least__squares__regressor_8cpp__incl.md5 create mode 100644 d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg create mode 100644 d1/d57/classcll__coll__graph.map create mode 100644 d1/d57/classcll__coll__graph.md5 create mode 100644 d1/d57/classcll__coll__graph.svg create mode 100644 d1/d76/buzz__number_8cpp.html create mode 100644 d1/d76/buzz__number_8cpp.js create mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/d77/structmst.html create mode 100644 d1/d77/structmst.js create mode 100644 d1/d7d/gcd__of__n__numbers_8cpp__incl.map create mode 100644 d1/d7d/gcd__of__n__numbers_8cpp__incl.md5 create mode 100644 d1/d7d/gcd__of__n__numbers_8cpp__incl.svg create mode 100644 d1/da1/decimal__to__hexadecimal_8cpp__incl.map create mode 100644 d1/da1/decimal__to__hexadecimal_8cpp__incl.md5 create mode 100644 d1/da1/decimal__to__hexadecimal_8cpp__incl.svg create mode 100644 d1/db3/structcompare.html create mode 100644 d1/db3/structcompare.js create mode 100644 d1/dc2/class_graph__coll__graph.map create mode 100644 d1/dc2/class_graph__coll__graph.md5 create mode 100644 d1/dc2/class_graph__coll__graph.svg create mode 100644 d1/dc2/classstack.html create mode 100644 d1/dc2/classstack.js create mode 100644 d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.map create mode 100644 d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 create mode 100644 d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg create mode 100644 d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map create mode 100644 d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 create mode 100644 d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg create mode 100644 d1/dc5/classlarge__number__coll__graph.map create mode 100644 d1/dc5/classlarge__number__coll__graph.md5 create mode 100644 d1/dc5/classlarge__number__coll__graph.svg create mode 100644 d1/dda/fast__interger__input_8cpp__incl.map create mode 100644 d1/dda/fast__interger__input_8cpp__incl.md5 create mode 100644 d1/dda/fast__interger__input_8cpp__incl.svg create mode 100644 d1/df2/structnode-members.html create mode 100644 d1/df3/hash__search_8cpp.html create mode 100644 d1/df3/hash__search_8cpp.js create mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map create mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 create mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg create mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map create mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5 create mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg create mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/df9/qr__decomposition_8cpp__incl.map create mode 100644 d1/df9/qr__decomposition_8cpp__incl.md5 create mode 100644 d1/df9/qr__decomposition_8cpp__incl.svg create mode 100644 d2/d05/class_min_heap.html create mode 100644 d2/d05/class_min_heap.js create mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map create mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5 create mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg create mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg create mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map create mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 create mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg create mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map create mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5 create mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg create mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map create mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5 create mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg create mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map create mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 create mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg create mode 100644 d2/d07/class_bit__coll__graph.map create mode 100644 d2/d07/class_bit__coll__graph.md5 create mode 100644 d2/d07/class_bit__coll__graph.svg create mode 100644 d2/d0b/fast__power_8cpp.html create mode 100644 d2/d0b/fast__power_8cpp.js create mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d2/d22/jump__search_8cpp.html create mode 100644 d2/d22/jump__search_8cpp.js create mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map create mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5 create mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg create mode 100644 d2/d26/addition__rule_8cpp__incl.map create mode 100644 d2/d26/addition__rule_8cpp__incl.md5 create mode 100644 d2/d26/addition__rule_8cpp__incl.svg create mode 100644 d2/d2c/structtower.html create mode 100644 d2/d2c/structtower.js create mode 100644 d2/d36/structqueue.html create mode 100644 d2/d36/structqueue.js create mode 100644 d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.map create mode 100644 d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.md5 create mode 100644 d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg create mode 100644 d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.map create mode 100644 d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.md5 create mode 100644 d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm.html create mode 100644 d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg create mode 100644 d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg create mode 100644 d2/d66/binary__search_8cpp__incl.map create mode 100644 d2/d66/binary__search_8cpp__incl.md5 create mode 100644 d2/d66/binary__search_8cpp__incl.svg create mode 100644 d2/d89/median__search_8cpp__incl.map create mode 100644 d2/d89/median__search_8cpp__incl.md5 create mode 100644 d2/d89/median__search_8cpp__incl.svg create mode 100644 d2/dc4/classstack__linked_list.html create mode 100644 d2/dc4/classstack__linked_list.js create mode 100644 d2/dcf/namespacestatistics.html create mode 100644 d2/dcf/namespacestatistics.js create mode 100644 d2/ddd/gaussian__elimination_8cpp__incl.map create mode 100644 d2/ddd/gaussian__elimination_8cpp__incl.md5 create mode 100644 d2/ddd/gaussian__elimination_8cpp__incl.svg create mode 100644 d2/def/prime__factorization_8cpp__incl.map create mode 100644 d2/def/prime__factorization_8cpp__incl.md5 create mode 100644 d2/def/prime__factorization_8cpp__incl.svg create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp.html create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp.js create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg create mode 100644 d3/d19/sparse__matrix_8cpp.html create mode 100644 d3/d19/sparse__matrix_8cpp.js create mode 100644 d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.map create mode 100644 d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.md5 create mode 100644 d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg create mode 100644 d3/d24/qr__decomposition_8cpp.html create mode 100644 d3/d24/qr__decomposition_8cpp.js create mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map create mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 create mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg create mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg create mode 100644 d3/d26/binary__search__tree_8cpp.html create mode 100644 d3/d26/binary__search__tree_8cpp.js create mode 100644 d3/d30/hash__search_8cpp__incl.map create mode 100644 d3/d30/hash__search_8cpp__incl.md5 create mode 100644 d3/d30/hash__search_8cpp__incl.svg create mode 100644 d3/d39/check__prime_8cpp__incl.map create mode 100644 d3/d39/check__prime_8cpp__incl.md5 create mode 100644 d3/d39/check__prime_8cpp__incl.svg create mode 100644 d3/d56/binomial__dist_8cpp__incl.map create mode 100644 d3/d56/binomial__dist_8cpp__incl.md5 create mode 100644 d3/d56/binomial__dist_8cpp__incl.svg create mode 100644 d3/d61/vector__important__functions_8cpp.html create mode 100644 d3/d61/vector__important__functions_8cpp.js create mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d3/d66/structlinkedlist__coll__graph.map create mode 100644 d3/d66/structlinkedlist__coll__graph.md5 create mode 100644 d3/d66/structlinkedlist__coll__graph.svg create mode 100644 d3/d7d/brute__force__string__searching_8cpp.html create mode 100644 d3/d7d/brute__force__string__searching_8cpp.js create mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d3/da3/classstatistics_1_1stats__computer2-members.html create mode 100644 d3/dbb/class_cycle_check.html create mode 100644 d3/dbb/class_cycle_check.js create mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map create mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 create mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg create mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map create mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5 create mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg create mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map create mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5 create mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp.html create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp.js create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5 create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg create mode 100644 d4/d0c/binary__search__tree_8cpp__incl.map create mode 100644 d4/d0c/binary__search__tree_8cpp__incl.md5 create mode 100644 d4/d0c/binary__search__tree_8cpp__incl.svg create mode 100644 d4/d0e/class_bit-members.html create mode 100644 d4/d1f/class_min_heap-members.html create mode 100644 d4/d21/least__common__multiple_8cpp.html create mode 100644 d4/d21/least__common__multiple_8cpp.js create mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map create mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 create mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg create mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map create mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5 create mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg create mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/d26/durand__kerner__roots_8cpp__incl.map create mode 100644 d4/d26/durand__kerner__roots_8cpp__incl.md5 create mode 100644 d4/d26/durand__kerner__roots_8cpp__incl.svg create mode 100644 d4/d26/durand__kerner__roots_8cpp__incl_org.svg create mode 100644 d4/d2c/struct_trie_1_1_trie_node__coll__graph.map create mode 100644 d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 create mode 100644 d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg create mode 100644 d4/d32/fibonacci__fast_8cpp.html create mode 100644 d4/d32/fibonacci__fast_8cpp.js create mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp.html create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp.js create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/d59/large__factorial_8cpp__incl.map create mode 100644 d4/d59/large__factorial_8cpp__incl.md5 create mode 100644 d4/d59/large__factorial_8cpp__incl.svg create mode 100644 d4/d60/kohonen__som__trace_8cpp__incl.map create mode 100644 d4/d60/kohonen__som__trace_8cpp__incl.md5 create mode 100644 d4/d60/kohonen__som__trace_8cpp__incl.svg create mode 100644 d4/d60/kohonen__som__trace_8cpp__incl_org.svg create mode 100644 d4/d68/qr__decompose_8h.html create mode 100644 d4/d68/qr__decompose_8h.js create mode 100644 d4/d68/qr__decompose_8h_source.html create mode 100644 d4/d6d/struct_entry-members.html create mode 100644 d4/d72/qr__eigen__values_8cpp__incl.map create mode 100644 d4/d72/qr__eigen__values_8cpp__incl.md5 create mode 100644 d4/d72/qr__eigen__values_8cpp__incl.svg create mode 100644 d4/d7a/shell__sort2_8cpp.html create mode 100644 d4/d7a/shell__sort2_8cpp.js create mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg create mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg create mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg create mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg create mode 100644 d4/d86/large__number_8h.html create mode 100644 d4/d86/large__number_8h_source.html create mode 100644 d4/d9c/primes__up__to__billion_8cpp.html create mode 100644 d4/d9c/primes__up__to__billion_8cpp.js create mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp.html create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp.js create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/da4/class_queue.html create mode 100644 d4/da4/class_queue.js create mode 100644 d4/da4/number__of__positive__divisors_8cpp__incl.map create mode 100644 d4/da4/number__of__positive__divisors_8cpp__incl.md5 create mode 100644 d4/da4/number__of__positive__divisors_8cpp__incl.svg create mode 100644 d4/db4/bayes__theorem_8cpp__incl.map create mode 100644 d4/db4/bayes__theorem_8cpp__incl.md5 create mode 100644 d4/db4/bayes__theorem_8cpp__incl.svg create mode 100644 d4/db4/struct_segment_intersection.html create mode 100644 d4/db4/struct_segment_intersection.js create mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map create mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5 create mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg create mode 100644 d4/db6/struct_min_heap_node-members.html create mode 100644 d4/dbd/structlca__coll__graph.map create mode 100644 d4/dbd/structlca__coll__graph.md5 create mode 100644 d4/dbd/structlca__coll__graph.svg create mode 100644 d4/dc7/extended__euclid__algorithm_8cpp__incl.map create mode 100644 d4/dc7/extended__euclid__algorithm_8cpp__incl.md5 create mode 100644 d4/dc7/extended__euclid__algorithm_8cpp__incl.svg create mode 100644 d4/dcb/classstack__coll__graph.map create mode 100644 d4/dcb/classstack__coll__graph.md5 create mode 100644 d4/dcb/classstack__coll__graph.svg create mode 100644 d4/dd9/structtrie.html create mode 100644 d4/dd9/structtrie.js create mode 100644 d4/de8/fast__interger__input_8cpp.html create mode 100644 d4/de8/fast__interger__input_8cpp.js create mode 100644 d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/deb/gcd__iterative__euclidean_8cpp__incl.map create mode 100644 d4/deb/gcd__iterative__euclidean_8cpp__incl.md5 create mode 100644 d4/deb/gcd__iterative__euclidean_8cpp__incl.svg create mode 100644 d4/def/kohonen__som__topology_8cpp.html create mode 100644 d4/def/kohonen__som__topology_8cpp.js create mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg create mode 100644 d4/df8/prime__numbers_8cpp__incl.map create mode 100644 d4/df8/prime__numbers_8cpp__incl.md5 create mode 100644 d4/df8/prime__numbers_8cpp__incl.svg create mode 100644 d5/d15/classcll.html create mode 100644 d5/d15/classcll.js create mode 100644 d5/d29/struct_min_heap_node.html create mode 100644 d5/d29/struct_min_heap_node.js create mode 100644 d5/d67/bayes__theorem_8cpp.html create mode 100644 d5/d67/bayes__theorem_8cpp.js create mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d5/d88/md__d_i_r_e_c_t_o_r_y.html create mode 100644 d5/d8b/least__common__multiple_8cpp__incl.map create mode 100644 d5/d8b/least__common__multiple_8cpp__incl.md5 create mode 100644 d5/d8b/least__common__multiple_8cpp__incl.svg create mode 100644 d5/d91/namespacesorting.html create mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map create mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 create mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg create mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map create mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 create mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg create mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map create mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 create mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg create mode 100644 d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.map create mode 100644 d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.md5 create mode 100644 d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.svg create mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map create mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 create mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg create mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map create mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 create mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg create mode 100644 d5/da1/structnode.html create mode 100644 d5/da1/structnode.js create mode 100644 d5/db0/adaline__learning_8cpp.html create mode 100644 d5/db0/adaline__learning_8cpp.js create mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map create mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5 create mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg create mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg create mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map create mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 create mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg create mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg create mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map create mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 create mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg create mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg create mode 100644 d5/dc2/structlca-members.html create mode 100644 d5/dca/vector__important__functions_8cpp__incl.map create mode 100644 d5/dca/vector__important__functions_8cpp__incl.md5 create mode 100644 d5/dca/vector__important__functions_8cpp__incl.svg create mode 100644 d5/dcd/kohonen__som__topology_8cpp__incl.map create mode 100644 d5/dcd/kohonen__som__topology_8cpp__incl.md5 create mode 100644 d5/dcd/kohonen__som__topology_8cpp__incl.svg create mode 100644 d5/dcd/kohonen__som__topology_8cpp__incl_org.svg create mode 100644 d5/ddf/struct_btree-members.html create mode 100644 d5/de2/structtower-members.html create mode 100644 d5/def/stairs__pattern_8cpp.html create mode 100644 d5/def/stairs__pattern_8cpp.js create mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d6/d1d/bubble__sort_8cpp__incl.map create mode 100644 d6/d1d/bubble__sort_8cpp__incl.md5 create mode 100644 d6/d1d/bubble__sort_8cpp__incl.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline.html create mode 100644 d6/d30/classmachine__learning_1_1adaline.js create mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map create mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5 create mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map create mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5 create mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map create mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 create mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map create mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 create mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg create mode 100644 d6/d38/newton__raphson__method_8cpp__incl.map create mode 100644 d6/d38/newton__raphson__method_8cpp__incl.md5 create mode 100644 d6/d38/newton__raphson__method_8cpp__incl.svg create mode 100644 d6/d48/structtrie-members.html create mode 100644 d6/d4a/addition__rule_8cpp.html create mode 100644 d6/d4a/addition__rule_8cpp.js create mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d6/d4c/gcd__recursive__euclidean_8cpp__incl.map create mode 100644 d6/d4c/gcd__recursive__euclidean_8cpp__incl.md5 create mode 100644 d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg create mode 100644 d6/d60/group__ode.html create mode 100644 d6/d60/group__ode.js create mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map create mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5 create mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg create mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map create mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5 create mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg create mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map create mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5 create mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg create mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map create mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5 create mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg create mode 100644 d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.map create mode 100644 d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5 create mode 100644 d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg create mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map create mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 create mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg create mode 100644 d6/d93/large__number_8h__dep__incl.map create mode 100644 d6/d93/large__number_8h__dep__incl.md5 create mode 100644 d6/d93/large__number_8h__dep__incl.svg create mode 100644 d6/d9d/large__factorial_8cpp.html create mode 100644 d6/d9d/large__factorial_8cpp.js create mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg create mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map create mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5 create mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg create mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map create mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 create mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg create mode 100644 d6/db0/binomial__dist_8cpp.html create mode 100644 d6/db0/binomial__dist_8cpp.js create mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map create mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 create mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg create mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map create mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5 create mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg create mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map create mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5 create mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg create mode 100644 d6/db4/ode__semi__implicit__euler_8cpp__incl.map create mode 100644 d6/db4/ode__semi__implicit__euler_8cpp__incl.md5 create mode 100644 d6/db4/ode__semi__implicit__euler_8cpp__incl.svg create mode 100644 d6/dbc/sparse__matrix_8cpp__incl.map create mode 100644 d6/dbc/sparse__matrix_8cpp__incl.md5 create mode 100644 d6/dbc/sparse__matrix_8cpp__incl.svg create mode 100644 d6/dbd/jump__search_8cpp__incl.map create mode 100644 d6/dbd/jump__search_8cpp__incl.md5 create mode 100644 d6/dbd/jump__search_8cpp__incl.svg create mode 100644 d6/dc0/interpolation__search2_8cpp__incl.map create mode 100644 d6/dc0/interpolation__search2_8cpp__incl.md5 create mode 100644 d6/dc0/interpolation__search2_8cpp__incl.svg create mode 100644 d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html create mode 100644 d6/dce/rabin__karp_8cpp.html create mode 100644 d6/dce/rabin__karp_8cpp.js create mode 100644 d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map create mode 100644 d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 create mode 100644 d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg create mode 100644 d6/dd3/ode__midpoint__euler_8cpp.html create mode 100644 d6/dd3/ode__midpoint__euler_8cpp.js create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg create mode 100644 d7/d1f/realtime__stats_8cpp__incl.map create mode 100644 d7/d1f/realtime__stats_8cpp__incl.md5 create mode 100644 d7/d1f/realtime__stats_8cpp__incl.svg create mode 100644 d7/d21/classstack__linked_list-members.html create mode 100644 d7/d2e/avltree_8cpp__incl.map create mode 100644 d7/d2e/avltree_8cpp__incl.md5 create mode 100644 d7/d2e/avltree_8cpp__incl.svg create mode 100644 d7/d35/matrix__exponentiation_8cpp.html create mode 100644 d7/d35/matrix__exponentiation_8cpp.js create mode 100644 d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.map create mode 100644 d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.md5 create mode 100644 d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.svg create mode 100644 d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.map create mode 100644 d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.md5 create mode 100644 d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg create mode 100644 d7/d40/class_solution__coll__graph.map create mode 100644 d7/d40/class_solution__coll__graph.md5 create mode 100644 d7/d40/class_solution__coll__graph.svg create mode 100644 d7/d41/struct_min_heap_node__coll__graph.map create mode 100644 d7/d41/struct_min_heap_node__coll__graph.md5 create mode 100644 d7/d41/struct_min_heap_node__coll__graph.svg create mode 100644 d7/d4c/spiral__print_8cpp__incl.map create mode 100644 d7/d4c/spiral__print_8cpp__incl.md5 create mode 100644 d7/d4c/spiral__print_8cpp__incl.svg create mode 100644 d7/d6a/bisection__method_8cpp.html create mode 100644 d7/d6a/bisection__method_8cpp.js create mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map create mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 create mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg create mode 100644 d7/d77/class_edge.html create mode 100644 d7/d77/class_edge.js create mode 100644 d7/d7c/classstatistics_1_1stats__computer1.html create mode 100644 d7/d7c/classstatistics_1_1stats__computer1.js create mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map create mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 create mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg create mode 100644 d7/d7f/section.html create mode 100644 d7/d89/double__factorial_8cpp.html create mode 100644 d7/d89/double__factorial_8cpp.js create mode 100644 d7/d8e/power__for__huge__numbers_8cpp__incl.map create mode 100644 d7/d8e/power__for__huge__numbers_8cpp__incl.md5 create mode 100644 d7/d8e/power__for__huge__numbers_8cpp__incl.svg create mode 100644 d7/da7/adaline__learning_8cpp__incl.map create mode 100644 d7/da7/adaline__learning_8cpp__incl.md5 create mode 100644 d7/da7/adaline__learning_8cpp__incl.svg create mode 100644 d7/da7/adaline__learning_8cpp__incl_org.svg create mode 100644 d7/dae/decimal__to__binary_8cpp__incl.map create mode 100644 d7/dae/decimal__to__binary_8cpp__incl.md5 create mode 100644 d7/dae/decimal__to__binary_8cpp__incl.svg create mode 100644 d7/dba/cll_8h_source.html create mode 100644 d7/de0/stack_8h_source.html create mode 100644 d8/d01/struct_item-members.html create mode 100644 d8/d10/structlist.html create mode 100644 d8/d10/structlist.js create mode 100644 d8/d13/bubble__sort_8cpp.html create mode 100644 d8/d13/bubble__sort_8cpp.js create mode 100644 d8/d38/queue_8h_source.html create mode 100644 d8/d38/structquery-members.html create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp.html create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp.js create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d8/d55/class_cycle_check-members.html create mode 100644 d8/d61/class_trie__coll__graph.map create mode 100644 d8/d61/class_trie__coll__graph.md5 create mode 100644 d8/d61/class_trie__coll__graph.svg create mode 100644 d8/d6c/line__segment__intersection_8cpp.html create mode 100644 d8/d6c/line__segment__intersection_8cpp.js create mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning.html create mode 100644 d8/d77/namespacemachine__learning.js create mode 100644 d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph_org.svg create mode 100644 d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph_org.svg create mode 100644 d8/d8a/exponential__search_8cpp.html create mode 100644 d8/d8a/exponential__search_8cpp.js create mode 100644 d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.map create mode 100644 d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.md5 create mode 100644 d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.svg create mode 100644 d8/d8e/struct_node-members.html create mode 100644 d8/d9b/classgraph-members.html create mode 100644 d8/dab/classstatistics_1_1stats__computer2.html create mode 100644 d8/dab/classstatistics_1_1stats__computer2.js create mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map create mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5 create mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg create mode 100644 d8/db9/structcompare-members.html create mode 100644 d8/dc8/struct_point.html create mode 100644 d8/dc8/struct_point.js create mode 100644 d8/dcc/namespacestd.html create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp.html create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp.js create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.map create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5 create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg create mode 100644 d8/dee/avltree_8cpp.html create mode 100644 d8/dee/avltree_8cpp.js create mode 100644 d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.map create mode 100644 d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.svg create mode 100644 d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.map create mode 100644 d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.svg create mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map create mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg create mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map create mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg create mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d00/factorial_8cpp.html create mode 100644 d9/d00/factorial_8cpp.js create mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d02/linear__search_8cpp.html create mode 100644 d9/d02/linear__search_8cpp.js create mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d03/namespacestring__search.html create mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map create mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 create mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg create mode 100644 d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map create mode 100644 d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5 create mode 100644 d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg create mode 100644 d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.map create mode 100644 d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.md5 create mode 100644 d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.svg create mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map create mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5 create mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg create mode 100644 d9/d1d/structqueue-members.html create mode 100644 d9/d21/classmachine__learning_1_1adaline-members.html create mode 100644 d9/d24/poisson__dist_8cpp.html create mode 100644 d9/d24/poisson__dist_8cpp.js create mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map create mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 create mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg create mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map create mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 create mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg create mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d28/class_queue__coll__graph.map create mode 100644 d9/d28/class_queue__coll__graph.md5 create mode 100644 d9/d28/class_queue__coll__graph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp.html create mode 100644 d9/d49/kohonen__som__trace_8cpp.js create mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.svg create mode 100644 d9/d57/structtrie__coll__graph.map create mode 100644 d9/d57/structtrie__coll__graph.md5 create mode 100644 d9/d57/structtrie__coll__graph.svg create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp.html create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp.js create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg create mode 100644 d9/d66/group__machine__learning.html create mode 100644 d9/d66/group__machine__learning.js create mode 100644 d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.map create mode 100644 d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.md5 create mode 100644 d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.svg create mode 100644 d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.map create mode 100644 d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.md5 create mode 100644 d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.svg create mode 100644 d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.map create mode 100644 d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5 create mode 100644 d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg create mode 100644 d9/d69/median__search_8cpp.html create mode 100644 d9/d69/median__search_8cpp.js create mode 100644 d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.map create mode 100644 d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5 create mode 100644 d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg create mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d78/factorial_8cpp__incl.map create mode 100644 d9/d78/factorial_8cpp__incl.md5 create mode 100644 d9/d78/factorial_8cpp__incl.svg create mode 100644 d9/d7d/primality__test_8cpp__incl.map create mode 100644 d9/d7d/primality__test_8cpp__incl.md5 create mode 100644 d9/d7d/primality__test_8cpp__incl.svg create mode 100644 d9/d89/fibonacci_8cpp.html create mode 100644 d9/d89/fibonacci_8cpp.js create mode 100644 d9/d90/struct_btree.html create mode 100644 d9/d90/struct_btree.js create mode 100644 d9/dbf/brute__force__string__searching_8cpp__incl.map create mode 100644 d9/dbf/brute__force__string__searching_8cpp__incl.md5 create mode 100644 d9/dbf/brute__force__string__searching_8cpp__incl.svg create mode 100644 d9/dd7/interpolation__search_8cpp.html create mode 100644 d9/dd7/interpolation__search_8cpp.js create mode 100644 d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/dd9/bisection__method_8cpp__incl.map create mode 100644 d9/dd9/bisection__method_8cpp__incl.md5 create mode 100644 d9/dd9/bisection__method_8cpp__incl.svg create mode 100644 d9/ddb/tower__of__hanoi_8cpp__incl.map create mode 100644 d9/ddb/tower__of__hanoi_8cpp__incl.md5 create mode 100644 d9/ddb/tower__of__hanoi_8cpp__incl.svg create mode 100644 d9/dee/classdouble__linked__list.html create mode 100644 d9/dee/classdouble__linked__list.js create mode 100644 d9/dfd/primes__up__to__billion_8cpp__incl.map create mode 100644 d9/dfd/primes__up__to__billion_8cpp__incl.md5 create mode 100644 d9/dfd/primes__up__to__billion_8cpp__incl.svg create mode 100644 da/d23/eulers__totient__function_8cpp.html create mode 100644 da/d23/eulers__totient__function_8cpp.js create mode 100644 da/d24/sqrt__double_8cpp.html create mode 100644 da/d24/sqrt__double_8cpp.js create mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 da/d35/sieve__of__eratosthenes_8cpp__incl.map create mode 100644 da/d35/sieve__of__eratosthenes_8cpp__incl.md5 create mode 100644 da/d35/sieve__of__eratosthenes_8cpp__incl.svg create mode 100644 da/d5d/non__recursive__merge__sort_8cpp__incl.map create mode 100644 da/d5d/non__recursive__merge__sort_8cpp__incl.md5 create mode 100644 da/d5d/non__recursive__merge__sort_8cpp__incl.svg create mode 100644 da/d7b/primality__test_8cpp.html create mode 100644 da/d7b/primality__test_8cpp.js create mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 da/d8a/paranthesis__matching_8cpp__incl.map create mode 100644 da/d8a/paranthesis__matching_8cpp__incl.md5 create mode 100644 da/d8a/paranthesis__matching_8cpp__incl.svg create mode 100644 da/d9a/class_graph.html create mode 100644 da/d9a/class_graph.js create mode 100644 da/d9a/palindrome__of__number_8cpp.html create mode 100644 da/d9a/palindrome__of__number_8cpp.js create mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 da/dd3/classmachine__learning_1_1adaline__coll__graph.map create mode 100644 da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 create mode 100644 da/dd3/classmachine__learning_1_1adaline__coll__graph.svg create mode 100644 da/dd9/happy__number_8cpp__incl.map create mode 100644 da/dd9/happy__number_8cpp__incl.md5 create mode 100644 da/dd9/happy__number_8cpp__incl.svg create mode 100644 da/de7/decimal__to__hexadecimal_8cpp.html create mode 100644 da/de7/decimal__to__hexadecimal_8cpp.js create mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map create mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 create mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg create mode 100644 da/df2/durand__kerner__roots_8cpp.html create mode 100644 da/df2/durand__kerner__roots_8cpp.js create mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.map create mode 100644 da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.md5 create mode 100644 da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.svg create mode 100644 da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.map create mode 100644 da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5 create mode 100644 da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg create mode 100644 da/dfd/buzz__number_8cpp__incl.map create mode 100644 da/dfd/buzz__number_8cpp__incl.md5 create mode 100644 da/dfd/buzz__number_8cpp__incl.svg create mode 100644 db/d07/spiral__print_8cpp.html create mode 100644 db/d07/spiral__print_8cpp.js create mode 100644 db/d0d/prime__factorization_8cpp.html create mode 100644 db/d0d/prime__factorization_8cpp.js create mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map create mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5 create mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg create mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map create mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5 create mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg create mode 100644 db/d30/fast__power_8cpp__incl.map create mode 100644 db/d30/fast__power_8cpp__incl.md5 create mode 100644 db/d30/fast__power_8cpp__incl.svg create mode 100644 db/d3c/tower__of__hanoi_8cpp.html create mode 100644 db/d3c/tower__of__hanoi_8cpp.js create mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map create mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5 create mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg create mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 db/d51/fibonacci__fast_8cpp__incl.map create mode 100644 db/d51/fibonacci__fast_8cpp__incl.md5 create mode 100644 db/d51/fibonacci__fast_8cpp__incl.svg create mode 100644 db/d66/struct_item.html create mode 100644 db/d66/struct_item.js create mode 100644 db/d82/classlarge__number.html create mode 100644 db/d82/classlarge__number.js create mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map create mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5 create mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg create mode 100644 db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.map create mode 100644 db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.md5 create mode 100644 db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.svg create mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map create mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 create mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg create mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map create mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5 create mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg create mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map create mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 create mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg create mode 100644 db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map create mode 100644 db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5 create mode 100644 db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg create mode 100644 db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg create mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map create mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 create mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg create mode 100644 db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.map create mode 100644 db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.md5 create mode 100644 db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.svg create mode 100644 db/d8b/struct_node.html create mode 100644 db/d8b/struct_node.js create mode 100644 db/d8f/struct_btree__coll__graph.map create mode 100644 db/d8f/struct_btree__coll__graph.md5 create mode 100644 db/d8f/struct_btree__coll__graph.svg create mode 100644 db/d93/check__prime_8cpp.html create mode 100644 db/d93/check__prime_8cpp.js create mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 db/dd3/ode__forward__euler_8cpp.html create mode 100644 db/dd3/ode__forward__euler_8cpp.js create mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map create mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 create mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg create mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map create mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 create mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg create mode 100644 db/dd4/structlist__coll__graph.map create mode 100644 db/dd4/structlist__coll__graph.md5 create mode 100644 db/dd4/structlist__coll__graph.svg create mode 100644 db/df3/happy__number_8cpp.html create mode 100644 db/df3/happy__number_8cpp.js create mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/d1a/pascal__triangle_8cpp.html create mode 100644 dc/d1a/pascal__triangle_8cpp.js create mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map create mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 create mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg create mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/d37/lu__decompose_8cpp__incl.map create mode 100644 dc/d37/lu__decompose_8cpp__incl.md5 create mode 100644 dc/d37/lu__decompose_8cpp__incl.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp.html create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp.js create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg create mode 100644 dc/d43/decimal__to__roman__numeral_8cpp__incl.map create mode 100644 dc/d43/decimal__to__roman__numeral_8cpp__incl.md5 create mode 100644 dc/d43/decimal__to__roman__numeral_8cpp__incl.svg create mode 100644 dc/d5f/qr__decompose_8h__dep__incl.map create mode 100644 dc/d5f/qr__decompose_8h__dep__incl.md5 create mode 100644 dc/d5f/qr__decompose_8h__dep__incl.svg create mode 100644 dc/d93/trie__modern_8cpp.html create mode 100644 dc/d93/trie__modern_8cpp.js create mode 100644 dc/db5/text__search_8cpp.html create mode 100644 dc/db5/text__search_8cpp.js create mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/dc5/ode__forward__euler_8cpp__incl.map create mode 100644 dc/dc5/ode__forward__euler_8cpp__incl.md5 create mode 100644 dc/dc5/ode__forward__euler_8cpp__incl.svg create mode 100644 dc/dc5/paranthesis__matching_8cpp.html create mode 100644 dc/dc5/paranthesis__matching_8cpp.js create mode 100644 dc/de0/fibonacci__large_8cpp__incl.map create mode 100644 dc/de0/fibonacci__large_8cpp__incl.md5 create mode 100644 dc/de0/fibonacci__large_8cpp__incl.svg create mode 100644 dc/de2/false__position_8cpp__incl.map create mode 100644 dc/de2/false__position_8cpp__incl.md5 create mode 100644 dc/de2/false__position_8cpp__incl.svg create mode 100644 dc/dfe/ternary__search_8cpp.html create mode 100644 dc/dfe/ternary__search_8cpp.js create mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map create mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 create mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg create mode 100644 dd/d00/class_queue-members.html create mode 100644 dd/d0e/double__factorial_8cpp__incl.map create mode 100644 dd/d0e/double__factorial_8cpp__incl.md5 create mode 100644 dd/d0e/double__factorial_8cpp__incl.svg create mode 100644 dd/d0f/text__search_8cpp__incl.map create mode 100644 dd/d0f/text__search_8cpp__incl.md5 create mode 100644 dd/d0f/text__search_8cpp__incl.svg create mode 100644 dd/d1b/structquery.html create mode 100644 dd/d1b/structquery.js create mode 100644 dd/d29/false__position_8cpp.html create mode 100644 dd/d29/false__position_8cpp.js create mode 100644 dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map create mode 100644 dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 create mode 100644 dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg create mode 100644 dd/d2f/class_trie.html create mode 100644 dd/d2f/class_trie.js create mode 100644 dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.map create mode 100644 dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.md5 create mode 100644 dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg create mode 100644 dd/d30/matrix__exponentiation_8cpp__incl.map create mode 100644 dd/d30/matrix__exponentiation_8cpp__incl.md5 create mode 100644 dd/d30/matrix__exponentiation_8cpp__incl.svg create mode 100644 dd/d3b/struct_entry.html create mode 100644 dd/d3b/struct_entry.js create mode 100644 dd/d4f/class_solution.html create mode 100644 dd/d4f/class_solution.js create mode 100644 dd/d51/classstack-members.html create mode 100644 dd/d65/lu__decompose_8cpp.html create mode 100644 dd/d65/lu__decompose_8cpp.js create mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map create mode 100644 dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 create mode 100644 dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg create mode 100644 dd/d75/structqueue__coll__graph.map create mode 100644 dd/d75/structqueue__coll__graph.md5 create mode 100644 dd/d75/structqueue__coll__graph.svg create mode 100644 dd/d7a/classdouble__linked__list-members.html create mode 100644 dd/d7f/classstack__linked_list__coll__graph.map create mode 100644 dd/d7f/classstack__linked_list__coll__graph.md5 create mode 100644 dd/d7f/classstack__linked_list__coll__graph.svg create mode 100644 dd/d82/large__number_8h__incl.map create mode 100644 dd/d82/large__number_8h__incl.md5 create mode 100644 dd/d82/large__number_8h__incl.svg create mode 100644 dd/d86/shell__sort2_8cpp__incl.map create mode 100644 dd/d86/shell__sort2_8cpp__incl.md5 create mode 100644 dd/d86/shell__sort2_8cpp__incl.svg create mode 100644 dd/d9b/classgraph.html create mode 100644 dd/d9b/classgraph.js create mode 100644 dd/da0/todo.html create mode 100644 dd/da8/struct_segment_intersection-members.html create mode 100644 dd/df3/line__segment__intersection_8cpp__incl.map create mode 100644 dd/df3/line__segment__intersection_8cpp__incl.md5 create mode 100644 dd/df3/line__segment__intersection_8cpp__incl.svg create mode 100644 dd/df4/structlca.html create mode 100644 dd/df4/structlca.js create mode 100644 dd/df5/poisson__dist_8cpp__incl.map create mode 100644 dd/df5/poisson__dist_8cpp__incl.md5 create mode 100644 dd/df5/poisson__dist_8cpp__incl.svg create mode 100644 de/d36/binary__exponent_8cpp__incl.map create mode 100644 de/d36/binary__exponent_8cpp__incl.md5 create mode 100644 de/d36/binary__exponent_8cpp__incl.svg create mode 100644 de/d47/string__fibonacci_8cpp.html create mode 100644 de/d47/string__fibonacci_8cpp.js create mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map create mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 create mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg create mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/d48/struct_trie_1_1_trie_node.html create mode 100644 de/d48/struct_trie_1_1_trie_node.js create mode 100644 de/d5b/eulers__totient__function_8cpp__incl.map create mode 100644 de/d5b/eulers__totient__function_8cpp__incl.md5 create mode 100644 de/d5b/eulers__totient__function_8cpp__incl.svg create mode 100644 de/d69/knuth__morris__pratt_8cpp__incl.map create mode 100644 de/d69/knuth__morris__pratt_8cpp__incl.md5 create mode 100644 de/d69/knuth__morris__pratt_8cpp__incl.svg create mode 100644 de/d6a/knuth__morris__pratt_8cpp.html create mode 100644 de/d6a/knuth__morris__pratt_8cpp.js create mode 100644 de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/d6c/palindrome__of__number_8cpp__incl.map create mode 100644 de/d6c/palindrome__of__number_8cpp__incl.md5 create mode 100644 de/d6c/palindrome__of__number_8cpp__incl.svg create mode 100644 de/d75/qr__eigen__values_8cpp.html create mode 100644 de/d75/qr__eigen__values_8cpp.js create mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.map create mode 100644 de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5 create mode 100644 de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 de/d7c/struct_trie_1_1_trie_node-members.html create mode 100644 de/d85/decimal__to__roman__numeral_8cpp.html create mode 100644 de/d85/decimal__to__roman__numeral_8cpp.js create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5 create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/d8a/class_trie-members.html create mode 100644 de/d91/class_queue___array-members.html create mode 100644 de/d91/structlist-members.html create mode 100644 de/d9b/prime__numbers_8cpp.html create mode 100644 de/d9b/prime__numbers_8cpp.js create mode 100644 de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.map create mode 100644 de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.md5 create mode 100644 de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg create mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/db2/quick__sort_8cpp__incl.map create mode 100644 de/db2/quick__sort_8cpp__incl.md5 create mode 100644 de/db2/quick__sort_8cpp__incl.svg create mode 100644 de/db5/class_edge-members.html create mode 100644 de/dc3/binaryheap_8cpp.html create mode 100644 de/dc3/binaryheap_8cpp.js create mode 100644 de/dc8/classlarge__number-members.html create mode 100644 de/dcf/binary__exponent_8cpp.html create mode 100644 de/dcf/binary__exponent_8cpp.js create mode 100644 de/dd3/newton__raphson__method_8cpp.html create mode 100644 de/dd3/newton__raphson__method_8cpp.js create mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map create mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 create mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg create mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map create mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5 create mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg create mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/de4/fibonacci__large_8cpp.html create mode 100644 de/de4/fibonacci__large_8cpp.js create mode 100644 df/d06/decimal__to__binary_8cpp.html create mode 100644 df/d06/decimal__to__binary_8cpp.js create mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map create mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5 create mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg create mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map create mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5 create mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg create mode 100644 df/d0f/fibonacci_8cpp__incl.map create mode 100644 df/d0f/fibonacci_8cpp__incl.md5 create mode 100644 df/d0f/fibonacci_8cpp__incl.svg create mode 100644 df/d27/class_bit.html create mode 100644 df/d27/class_bit.js create mode 100644 df/d39/interpolation__search2_8cpp.html create mode 100644 df/d39/interpolation__search2_8cpp.js create mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 df/d3c/exponential__search_8cpp__incl.map create mode 100644 df/d3c/exponential__search_8cpp__incl.md5 create mode 100644 df/d3c/exponential__search_8cpp__incl.svg create mode 100644 df/d86/rabin__karp_8cpp__incl.map create mode 100644 df/d86/rabin__karp_8cpp__incl.md5 create mode 100644 df/d86/rabin__karp_8cpp__incl.svg create mode 100644 df/dc8/successive__approximation_8cpp.html create mode 100644 df/dc8/successive__approximation_8cpp.js create mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 df/dd4/stairs__pattern_8cpp__incl.map create mode 100644 df/dd4/stairs__pattern_8cpp__incl.md5 create mode 100644 df/dd4/stairs__pattern_8cpp__incl.svg create mode 100644 df/dd5/binary__search_8cpp.html create mode 100644 df/dd5/binary__search_8cpp.js create mode 100644 df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map create mode 100644 df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 create mode 100644 df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg create mode 100644 df/dd7/structlinkedlist-members.html create mode 100644 df/ddc/struct_node__coll__graph.map create mode 100644 df/ddc/struct_node__coll__graph.md5 create mode 100644 df/ddc/struct_node__coll__graph.svg create mode 100644 df/def/power__for__huge__numbers_8cpp.html create mode 100644 df/def/power__for__huge__numbers_8cpp.js create mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map create mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5 create mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg create mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dir_074119ce3a874b57120c49a0cc4bb5ad.html create mode 100644 dir_0eaa691bd54ab0922ca7f50599de6d22.html create mode 100644 dir_12552d7fa429bf94a2e32e5cf39f7e69.html create mode 100644 dir_19b2bf9199a15c634a08b1ede1dd896a.html create mode 100644 dir_19b2bf9199a15c634a08b1ede1dd896a.js create mode 100644 dir_296d53ceaeaa7e099814a6def439fe8a.html create mode 100644 dir_296d53ceaeaa7e099814a6def439fe8a.js create mode 100644 dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html create mode 100644 dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js create mode 100644 dir_3343723ae086de42ee4ca9774da3a13f.html create mode 100644 dir_3343723ae086de42ee4ca9774da3a13f.js create mode 100644 dir_35422be6552f1b3672c1b6c4aba2da64.html create mode 100644 dir_73a3cc5065b223eb41b02873c0e19f0e.html create mode 100644 dir_73a3cc5065b223eb41b02873c0e19f0e.js create mode 100644 dir_82e494173a87936756866de2fa774307.html create mode 100644 dir_82e494173a87936756866de2fa774307.js create mode 100644 dir_8a20dd5bfd5341a725342bf72b6b686f.html create mode 100644 dir_9510827d0b234b3cc54b29892f217477.html create mode 100644 dir_9510827d0b234b3cc54b29892f217477.js create mode 100644 dir_9c6faab82c22511b50177aa2e38e2780.html create mode 100644 dir_9c6faab82c22511b50177aa2e38e2780.js create mode 100644 dir_bb1b521853a9c46347182a9d10420771.html create mode 100644 dir_bb1b521853a9c46347182a9d10420771.js create mode 100644 dir_c11585dfcef32a26e29098facab6c144.html create mode 100644 dir_e3380d2178455503f266746fb14246a5.html create mode 100644 dir_e3380d2178455503f266746fb14246a5.js create mode 100644 dir_ece9b94c107bbaa1dd68197a8c9983b9.html create mode 100644 dir_f1797d0c2a0a12033e7d74efffeb14e1.html create mode 100644 dir_f1797d0c2a0a12033e7d74efffeb14e1.js create mode 100644 doc.png create mode 100644 doxygen.css create mode 100644 doxygen.png create mode 100644 dynsections.js create mode 100644 files.html create mode 100644 files_dup.js create mode 100644 folderclosed.png create mode 100644 folderopen.png create mode 100644 functions.html create mode 100644 functions_func.html create mode 100644 functions_rela.html create mode 100644 functions_vars.html create mode 100644 globals.html create mode 100644 globals_a.html create mode 100644 globals_b.html create mode 100644 globals_c.html create mode 100644 globals_d.html create mode 100644 globals_defs.html create mode 100644 globals_dup.js create mode 100644 globals_e.html create mode 100644 globals_f.html create mode 100644 globals_func.html create mode 100644 globals_func.js create mode 100644 globals_func_a.html create mode 100644 globals_func_b.html create mode 100644 globals_func_c.html create mode 100644 globals_func_d.html create mode 100644 globals_func_e.html create mode 100644 globals_func_f.html create mode 100644 globals_func_g.html create mode 100644 globals_func_h.html create mode 100644 globals_func_i.html create mode 100644 globals_func_j.html create mode 100644 globals_func_l.html create mode 100644 globals_func_m.html create mode 100644 globals_func_n.html create mode 100644 globals_func_o.html create mode 100644 globals_func_p.html create mode 100644 globals_func_r.html create mode 100644 globals_func_s.html create mode 100644 globals_func_t.html create mode 100644 globals_func_u.html create mode 100644 globals_g.html create mode 100644 globals_h.html create mode 100644 globals_i.html create mode 100644 globals_j.html create mode 100644 globals_k.html create mode 100644 globals_l.html create mode 100644 globals_m.html create mode 100644 globals_n.html create mode 100644 globals_o.html create mode 100644 globals_p.html create mode 100644 globals_r.html create mode 100644 globals_s.html create mode 100644 globals_t.html create mode 100644 globals_type.html create mode 100644 globals_u.html create mode 100644 globals_vars.html create mode 100644 graph_legend.html create mode 100644 graph_legend.md5 create mode 100644 graph_legend.svg create mode 100644 index.html create mode 100644 jquery.js create mode 100644 menu.js create mode 100644 menudata.js create mode 100644 modules.html create mode 100644 modules.js create mode 100644 namespacemembers.html create mode 100644 namespacemembers_func.html create mode 100644 namespaces.html create mode 100644 namespaces_dup.js create mode 100644 nav_f.png create mode 100644 nav_g.png create mode 100644 nav_h.png create mode 100644 navtree.css create mode 100644 navtree.js create mode 100644 navtreedata.js create mode 100644 navtreeindex0.js create mode 100644 navtreeindex1.js create mode 100644 navtreeindex2.js create mode 100644 navtreeindex3.js create mode 100644 open.png create mode 100644 pages.html create mode 100644 resize.js create mode 100644 search/all_0.html create mode 100644 search/all_0.js create mode 100644 search/all_1.html create mode 100644 search/all_1.js create mode 100644 search/all_10.html create mode 100644 search/all_10.js create mode 100644 search/all_11.html create mode 100644 search/all_11.js create mode 100644 search/all_12.html create mode 100644 search/all_12.js create mode 100644 search/all_13.html create mode 100644 search/all_13.js create mode 100644 search/all_14.html create mode 100644 search/all_14.js create mode 100644 search/all_15.html create mode 100644 search/all_15.js create mode 100644 search/all_16.html create mode 100644 search/all_16.js create mode 100644 search/all_17.html create mode 100644 search/all_17.js create mode 100644 search/all_18.html create mode 100644 search/all_18.js create mode 100644 search/all_19.html create mode 100644 search/all_19.js create mode 100644 search/all_1a.html create mode 100644 search/all_1a.js create mode 100644 search/all_1b.html create mode 100644 search/all_1b.js create mode 100644 search/all_2.html create mode 100644 search/all_2.js create mode 100644 search/all_3.html create mode 100644 search/all_3.js create mode 100644 search/all_4.html create mode 100644 search/all_4.js create mode 100644 search/all_5.html create mode 100644 search/all_5.js create mode 100644 search/all_6.html create mode 100644 search/all_6.js create mode 100644 search/all_7.html create mode 100644 search/all_7.js create mode 100644 search/all_8.html create mode 100644 search/all_8.js create mode 100644 search/all_9.html create mode 100644 search/all_9.js create mode 100644 search/all_a.html create mode 100644 search/all_a.js create mode 100644 search/all_b.html create mode 100644 search/all_b.js create mode 100644 search/all_c.html create mode 100644 search/all_c.js create mode 100644 search/all_d.html create mode 100644 search/all_d.js create mode 100644 search/all_e.html create mode 100644 search/all_e.js create mode 100644 search/all_f.html create mode 100644 search/all_f.js create mode 100644 search/classes_0.html create mode 100644 search/classes_0.js create mode 100644 search/classes_1.html create mode 100644 search/classes_1.js create mode 100644 search/classes_10.html create mode 100644 search/classes_10.js create mode 100644 search/classes_11.html create mode 100644 search/classes_11.js create mode 100644 search/classes_12.html create mode 100644 search/classes_12.js create mode 100644 search/classes_13.html create mode 100644 search/classes_13.js create mode 100644 search/classes_14.html create mode 100644 search/classes_14.js create mode 100644 search/classes_15.html create mode 100644 search/classes_15.js create mode 100644 search/classes_16.html create mode 100644 search/classes_16.js create mode 100644 search/classes_17.html create mode 100644 search/classes_17.js create mode 100644 search/classes_18.html create mode 100644 search/classes_18.js create mode 100644 search/classes_2.html create mode 100644 search/classes_2.js create mode 100644 search/classes_3.html create mode 100644 search/classes_3.js create mode 100644 search/classes_4.html create mode 100644 search/classes_4.js create mode 100644 search/classes_5.html create mode 100644 search/classes_5.js create mode 100644 search/classes_6.html create mode 100644 search/classes_6.js create mode 100644 search/classes_7.html create mode 100644 search/classes_7.js create mode 100644 search/classes_8.html create mode 100644 search/classes_8.js create mode 100644 search/classes_9.html create mode 100644 search/classes_9.js create mode 100644 search/classes_a.html create mode 100644 search/classes_a.js create mode 100644 search/classes_b.html create mode 100644 search/classes_b.js create mode 100644 search/classes_c.html create mode 100644 search/classes_c.js create mode 100644 search/classes_d.html create mode 100644 search/classes_d.js create mode 100644 search/classes_e.html create mode 100644 search/classes_e.js create mode 100644 search/classes_f.html create mode 100644 search/classes_f.js create mode 100644 search/close.png create mode 100644 search/defines_0.html create mode 100644 search/defines_0.js create mode 100644 search/defines_1.html create mode 100644 search/defines_1.js create mode 100644 search/defines_2.html create mode 100644 search/defines_2.js create mode 100644 search/defines_3.html create mode 100644 search/defines_3.js create mode 100644 search/defines_4.html create mode 100644 search/defines_4.js create mode 100644 search/defines_5.html create mode 100644 search/defines_5.js create mode 100644 search/defines_6.html create mode 100644 search/defines_6.js create mode 100644 search/files_0.html create mode 100644 search/files_0.js create mode 100644 search/files_1.html create mode 100644 search/files_1.js create mode 100644 search/files_10.html create mode 100644 search/files_10.js create mode 100644 search/files_11.html create mode 100644 search/files_11.js create mode 100644 search/files_12.html create mode 100644 search/files_12.js create mode 100644 search/files_13.html create mode 100644 search/files_13.js create mode 100644 search/files_14.html create mode 100644 search/files_14.js create mode 100644 search/files_2.html create mode 100644 search/files_2.js create mode 100644 search/files_3.html create mode 100644 search/files_3.js create mode 100644 search/files_4.html create mode 100644 search/files_4.js create mode 100644 search/files_5.html create mode 100644 search/files_5.js create mode 100644 search/files_6.html create mode 100644 search/files_6.js create mode 100644 search/files_7.html create mode 100644 search/files_7.js create mode 100644 search/files_8.html create mode 100644 search/files_8.js create mode 100644 search/files_9.html create mode 100644 search/files_9.js create mode 100644 search/files_a.html create mode 100644 search/files_a.js create mode 100644 search/files_b.html create mode 100644 search/files_b.js create mode 100644 search/files_c.html create mode 100644 search/files_c.js create mode 100644 search/files_d.html create mode 100644 search/files_d.js create mode 100644 search/files_e.html create mode 100644 search/files_e.js create mode 100644 search/files_f.html create mode 100644 search/files_f.js create mode 100644 search/functions_0.html create mode 100644 search/functions_0.js create mode 100644 search/functions_1.html create mode 100644 search/functions_1.js create mode 100644 search/functions_10.html create mode 100644 search/functions_10.js create mode 100644 search/functions_11.html create mode 100644 search/functions_11.js create mode 100644 search/functions_12.html create mode 100644 search/functions_12.js create mode 100644 search/functions_13.html create mode 100644 search/functions_13.js create mode 100644 search/functions_14.html create mode 100644 search/functions_14.js create mode 100644 search/functions_15.html create mode 100644 search/functions_15.js create mode 100644 search/functions_16.html create mode 100644 search/functions_16.js create mode 100644 search/functions_17.html create mode 100644 search/functions_17.js create mode 100644 search/functions_18.html create mode 100644 search/functions_18.js create mode 100644 search/functions_19.html create mode 100644 search/functions_19.js create mode 100644 search/functions_1a.html create mode 100644 search/functions_1a.js create mode 100644 search/functions_1b.html create mode 100644 search/functions_1b.js create mode 100644 search/functions_2.html create mode 100644 search/functions_2.js create mode 100644 search/functions_3.html create mode 100644 search/functions_3.js create mode 100644 search/functions_4.html create mode 100644 search/functions_4.js create mode 100644 search/functions_5.html create mode 100644 search/functions_5.js create mode 100644 search/functions_6.html create mode 100644 search/functions_6.js create mode 100644 search/functions_7.html create mode 100644 search/functions_7.js create mode 100644 search/functions_8.html create mode 100644 search/functions_8.js create mode 100644 search/functions_9.html create mode 100644 search/functions_9.js create mode 100644 search/functions_a.html create mode 100644 search/functions_a.js create mode 100644 search/functions_b.html create mode 100644 search/functions_b.js create mode 100644 search/functions_c.html create mode 100644 search/functions_c.js create mode 100644 search/functions_d.html create mode 100644 search/functions_d.js create mode 100644 search/functions_e.html create mode 100644 search/functions_e.js create mode 100644 search/functions_f.html create mode 100644 search/functions_f.js create mode 100644 search/groups_0.html create mode 100644 search/groups_0.js create mode 100644 search/groups_1.html create mode 100644 search/groups_1.js create mode 100644 search/mag_sel.png create mode 100644 search/namespaces_0.html create mode 100644 search/namespaces_0.js create mode 100644 search/namespaces_1.html create mode 100644 search/namespaces_1.js create mode 100644 search/namespaces_2.html create mode 100644 search/namespaces_2.js create mode 100644 search/nomatches.html create mode 100644 search/pages_0.html create mode 100644 search/pages_0.js create mode 100644 search/pages_1.html create mode 100644 search/pages_1.js create mode 100644 search/pages_2.html create mode 100644 search/pages_2.js create mode 100644 search/pages_3.html create mode 100644 search/pages_3.js create mode 100644 search/related_0.html create mode 100644 search/related_0.js create mode 100644 search/search.css create mode 100644 search/search.js create mode 100644 search/search_l.png create mode 100644 search/search_m.png create mode 100644 search/search_r.png create mode 100644 search/searchdata.js create mode 100644 search/typedefs_0.html create mode 100644 search/typedefs_0.js create mode 100644 search/typedefs_1.html create mode 100644 search/typedefs_1.js create mode 100644 search/variables_0.html create mode 100644 search/variables_0.js create mode 100644 search/variables_1.html create mode 100644 search/variables_1.js create mode 100644 search/variables_10.html create mode 100644 search/variables_10.js create mode 100644 search/variables_11.html create mode 100644 search/variables_11.js create mode 100644 search/variables_12.html create mode 100644 search/variables_12.js create mode 100644 search/variables_2.html create mode 100644 search/variables_2.js create mode 100644 search/variables_3.html create mode 100644 search/variables_3.js create mode 100644 search/variables_4.html create mode 100644 search/variables_4.js create mode 100644 search/variables_5.html create mode 100644 search/variables_5.js create mode 100644 search/variables_6.html create mode 100644 search/variables_6.js create mode 100644 search/variables_7.html create mode 100644 search/variables_7.js create mode 100644 search/variables_8.html create mode 100644 search/variables_8.js create mode 100644 search/variables_9.html create mode 100644 search/variables_9.js create mode 100644 search/variables_a.html create mode 100644 search/variables_a.js create mode 100644 search/variables_b.html create mode 100644 search/variables_b.js create mode 100644 search/variables_c.html create mode 100644 search/variables_c.js create mode 100644 search/variables_d.html create mode 100644 search/variables_d.js create mode 100644 search/variables_e.html create mode 100644 search/variables_e.js create mode 100644 search/variables_f.html create mode 100644 search/variables_f.js create mode 100644 splitbar.png create mode 100644 svgpan.js create mode 100644 sync_off.png create mode 100644 sync_on.png create mode 100644 tab_a.png create mode 100644 tab_b.png create mode 100644 tab_h.png create mode 100644 tab_s.png create mode 100644 tabs.css diff --git a/annotated.html b/annotated.html new file mode 100644 index 000000000..26bc771f5 --- /dev/null +++ b/annotated.html @@ -0,0 +1,150 @@ + + +
+ + + + +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
| ▼Nmachine_learning | Machine learning algorithms |
| Cadaline | |
| ▼Nstatistics | Statistical algorithms |
| Cstats_computer1 | |
| Cstats_computer2 | |
| CBit | |
| CBtree | |
| Ccll | |
| Ccompare | |
| CCycleCheck | |
| Cdouble_linked_list | |
| CEdge | |
| CEntry | |
| Cgraph | |
| CGraph | |
| CItem | |
| Clarge_number | |
| Clca | |
| Clinkedlist | |
| Clist | |
| CMinHeap | |
| CMinHeapNode | |
| Cmst | |
| CNode | |
| Cnode | |
| CPoint | |
| Cquery | |
| Cqueue | |
| CQueue | |
| CQueue_Array | |
| CSegmentIntersection | |
| CSolution | |
| Cstack | |
| Cstack_linkedList | |
| Ctower | |
| ▼CTrie | |
| CTrieNode | |
| Ctrie |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+
|
+lca | +
|
+stats_computer2 (statistics) | +|||
| linkedlist | +
|
+||||||
| adaline (machine_learning) | +Edge | +list | +query | +||||
|
+Entry | +
|
+queue | +tower | +|||
|
+Queue | +Trie | +|||||
| Bit | +MinHeap | +Queue_Array | +trie | +||||
| Btree | +graph | +MinHeapNode | +
|
+Trie::TrieNode | +|||
|
+Graph | +mst | +|||||
|
+
|
+SegmentIntersection | +|||||
| cll | +Solution | +||||||
| compare | +Item | +Node | +stack | +||||
| CycleCheck | +
|
+node | +stack_linkedList | +||||
|
+
|
+stats_computer1 (statistics) | +|||||
| large_number | +|||||||
| double_linked_list | +Point | +||||||
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Get centre and radius of the smallest circle that circumscribes given set of points. +More...
+#include <cmath>#include <iostream>#include <vector>+Classes | |
| struct | Point |
+Functions | |
| double | LenghtLine (const Point &A, const Point &B) |
| double | TriangleArea (const Point &A, const Point &B, const Point &C) |
| bool | PointInCircle (const std::vector< Point > &P, const Point &Center, double R) |
| double | circle (const std::vector< Point > &P) |
| void | test () |
| void | test2 () |
| void | test3 () |
| int | main () |
Get centre and radius of the smallest circle that circumscribes given set of points.
+| double circle | +( | +const std::vector< Point > & | +P | ) | ++ |
Find the centre and radius of a circle enclosing a set of points.
+The function returns the radius of the circle and prints the coordinated of the centre of the circle.
| [in] | P | vector of points |
Compute the Euclidian distance between two points \(A\equiv(x_1,y_1)\) and \(B\equiv(x_2,y_2)\) using the formula:
+\[d=\sqrt{\left(x_1-x_2\right)^2+\left(y_1-y_2\right)^2}\] +
+| [in] | A | point A |
| [in] | B | point B |
| int main | +( | +) | ++ |
| bool PointInCircle | +( | +const std::vector< Point > & | +P, | +
| + | + | const Point & | +Center, | +
| + | + | double | +R | +
| + | ) | ++ |
Check if a set of points lie within given circle. This is true if the distance of all the points from the centre of the circle is less than the radius of the circle
| [in] | P | set of points to check |
| [in] | Center | coordinates to centre of the circle |
| [in] | R | radius of the circle |
| void test | +( | +) | ++ |
Test case: result should be:
+ Circle with
+ radius 3.318493136080724
+ centre at (3.0454545454545454, 1.3181818181818181)
| void test2 | +( | +) | ++ |
Test case: result should be:
+ Circle with
+ radius 1.4142135623730951
+ centre at (1.0, 1.0)
| void test3 | +( | +) | ++ |
Test case: result should be:
+ Circle with
+ radius 1.821078397711709
+ centre at (2.142857142857143, 1.7857142857142856)
| double TriangleArea | +( | +const Point & | +A, | +
| + | + | const Point & | +B, | +
| + | + | const Point & | +C | +
| + | ) | ++ |
Compute the area of triangle formed by three points using Heron's formula. If the lengths of the sides of the triangle are \(a,\,b,\,c\) and \(s=\displaystyle\frac{a+b+c}{2}\) is the semi-perimeter then the area is given by
+\[A=\sqrt{s(s-a)(s-b)(s-c)}\] +
+| [in] | A | vertex A |
| [in] | B | vertex B |
| [in] | C | vertex C |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute statistics for data entered in rreal-time. +More...
+#include <cassert>#include <cmath>#include <iostream>+Classes | |
| class | statistics::stats_computer1< T > |
| class | statistics::stats_computer2< T > |
+Namespaces | |
| statistics | |
| Statistical algorithms. | |
+Functions | |
| void | test_function (const float *test_data, const int number_of_samples) |
| int | main (int argc, char **argv) |
Compute statistics for data entered in rreal-time.
+This algorithm is really beneficial to compute statistics on data read in realtime. For example, devices reading biometrics data. The algorithm is simple enough to be easily implemented in an embedded system.
+| int main | +( | +int | +argc, | +
| + | + | char ** | +argv | +
| + | ) | ++ |
Main function
+| void test_function | +( | +const float * | +test_data, | +
| + | + | const int | +number_of_samples | +
| + | ) | ++ |
Test the algorithm implementation
| [in] | test_data | array of data to test the algorithms |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for cll, including all inherited members.
+| cll() (defined in cll) | cll | |
| display() (defined in cll) | cll | |
| find_item(int item_to_find) (defined in cll) | cll | |
| get_size() (defined in cll) | cll | |
| head (defined in cll) | cll | protected |
| insert_front(int new_data) (defined in cll) | cll | |
| insert_tail(int new_data) (defined in cll) | cll | |
| operator*() (defined in cll) | cll | |
| operator++() (defined in cll) | cll | |
| total (defined in cll) | cll | protected |
| ~cll() (defined in cll) | cll |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for statistics::stats_computer1< T >, including all inherited members.
+| Ex (defined in statistics::stats_computer1< T >) | statistics::stats_computer1< T > | private |
| Ex2 (defined in statistics::stats_computer1< T >) | statistics::stats_computer1< T > | private |
| K (defined in statistics::stats_computer1< T >) | statistics::stats_computer1< T > | private |
| mean() const | statistics::stats_computer1< T > | inline |
| n (defined in statistics::stats_computer1< T >) | statistics::stats_computer1< T > | private |
| new_val(T x) | statistics::stats_computer1< T > | inline |
| operator>>(std::istream &input, stats_computer1 &stat) | statistics::stats_computer1< T > | friend |
| std() const | statistics::stats_computer1< T > | inline |
| variance() const | statistics::stats_computer1< T > | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
C++ Program to calculate number of divisors. +More...
+#include <iostream>#include <vector>+Functions | |
| int | number_of_positive_divisors (int n) |
| int | main () |
C++ Program to calculate number of divisors.
+This algorithm use the prime factorization approach. Any number can be written in multiplication of its prime factors.
+Let N = P1^E1 * P2^E2 ... Pk^Ek
+Therefore. number-of-divisors(N) = (E1+1) * (E2+1) ... (Ek+1).
+Where P1, P2 ... Pk are prime factors and E1, E2 ... Ek are exponents respectively.
Example:-
+N = 36
+36 = (3^2 * 2^2)
+number_of_positive_divisors(36) = (2+1) * (2+1) = 9.
+list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.
Similarly if N is -36 at that time number of positive divisors remain same.
+Example:-
+N = -36
+-36 = -1 * (3^2 * 2^2)
+number_of_positive_divisors(-36) = (2+1) * (2+1) = 9.
+list of positive divisors of -36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.
| int main | +( | +) | ++ |
Main function
+| int number_of_positive_divisors | +( | +int | +n | ) | ++ |
Algorithm
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
#include <cstddef>#include <iostream>#include <utility>+Namespaces | |
| sorting | |
| Sorting algorithms. | |
+Functions | |
| template<class Iterator > | |
| void | sorting::merge (Iterator l, Iterator r, const Iterator e, char b[]) |
| merges 2 sorted adjacent segments into a larger sorted segment More... | |
| template<class Iterator > | |
| void | sorting::non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n) |
| bottom-up merge sort which sorts elements in a non-decreasing order More... | |
| template<class Iterator > | |
| void | sorting::non_recursive_merge_sort (const Iterator first, const size_t n) |
| bottom-up merge sort which sorts elements in a non-decreasing order More... | |
| template<class Iterator > | |
| void | sorting::non_recursive_merge_sort (const Iterator first, const Iterator last) |
| bottom-up merge sort which sorts elements in a non-decreasing order More... | |
| +int | main (int argc, char **argv) |
Copyright 2020
+A generic implementation of non-recursive merge sort.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| +void | enqueue (int) |
| +int | dequeue () |
| +void | display () |
+Public Attributes | |
| +int * | arr = new int[size] |
+Private Attributes | |
| +int | front |
| +int | rear |
| +int | size |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Gaussian elimination method +More...
+#include <iostream>+Functions | |
| int | main () |
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Attributes | |
| +int | data |
| +linkedlist * | next |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Solution, including all inherited members.
+| bridge (defined in Solution) | Solution | private |
| dfs(int current_node, int parent) (defined in Solution) | Solution | inlineprivate |
| graph (defined in Solution) | Solution | private |
| in_time (defined in Solution) | Solution | private |
| out_time (defined in Solution) | Solution | private |
| search_bridges(int n, const vector< vector< int >> &connections) (defined in Solution) | Solution | inline |
| timer (defined in Solution) | Solution | private |
| visited (defined in Solution) | Solution | private |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This program aims at calculating the GCD of n numbers by division method. +More...
+#include <iostream>+Functions | |
| int | gcd (int *a, int n) |
| int | main () |
This program aims at calculating the GCD of n numbers by division method.
+ +| int gcd | +( | +int * | +a, | +
| + | + | int | +n | +
| + | ) | ++ |
Compute GCD using division algorithm
+| [in] | a | array of integers to compute GCD for |
| [in] | n | number of integers in array a |
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Graph, including all inherited members.
+| addEdge(int src, int dst, int weight) (defined in Graph) | Graph | inline |
| addEdge(int src, int dst, int weight) (defined in Graph) | Graph | inline |
| addEdge(Edge const &edge) | Graph | inline |
| addEdge(unsigned int source, unsigned int destination) | Graph | inline |
| addEdge(int src, int dst, int weight) (defined in Graph) | Graph | inline |
| addVertices(unsigned int num=1) | Graph | inline |
| bfs(int source, int sink) (defined in Graph) | Graph | inlineprivate |
| capacity (defined in Graph) | Graph | private |
| edge_participated (defined in Graph) | Graph | private |
| edgeNum (defined in Graph) | Graph | |
| edges (defined in Graph) | Graph | |
| edges (defined in Graph) | Graph | |
| ford_fulkerson(void) (defined in Graph) | Graph | inline |
| getAdjList() const | Graph | inline |
| getVertices() const | Graph | inline |
| Graph(int V, int E) (defined in Graph) | Graph | inline |
| Graph(int V) (defined in Graph) | Graph | inline |
| Graph() (defined in Graph) | Graph | inline |
| Graph(Graph &&)=default (defined in Graph) | Graph | |
| Graph(Graph const &)=default (defined in Graph) | Graph | |
| Graph(unsigned int vertices, AdjList const &adjList) | Graph | inline |
| Graph(unsigned int vertices, AdjList &&adjList) | Graph | inline |
| Graph(unsigned int vertices, std::vector< Edge > const &edges) | Graph | inline |
| Graph() (defined in Graph) | Graph | inline |
| Graph(const int V) (defined in Graph) | Graph | inline |
| m_adjList (defined in Graph) | Graph | private |
| m_vertices (defined in Graph) | Graph | private |
| max_flow (defined in Graph) | Graph | private |
| operator=(Graph &&)=default (defined in Graph) | Graph | |
| operator=(Graph const &)=default (defined in Graph) | Graph | |
| parent (defined in Graph) | Graph | private |
| print_flow_info(void) (defined in Graph) | Graph | inline |
| residual_capacity (defined in Graph) | Graph | private |
| set_graph(void) (defined in Graph) | Graph | inline |
| sink (defined in Graph) | Graph | private |
| source (defined in Graph) | Graph | private |
| total_edges (defined in Graph) | Graph | private |
| total_nodes (defined in Graph) | Graph | private |
| vertexNum (defined in Graph) | Graph | |
| visited (defined in Graph) | Graph | private |
| ~Graph() (defined in Graph) | Graph | inline |
| ~Graph()=default (defined in Graph) | Graph |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Quick sort algorithm. +More...
+#include <cstdlib>#include <iostream>+Namespaces | |
| sorting | |
| Sorting algorithms. | |
+Functions | |
| int | sorting::partition (int arr[], int low, int high) |
| void | sorting::quickSort (int arr[], int low, int high) |
| +void | show (int arr[], int size) |
| int | main () |
Quick sort algorithm.
+Implementation Details - Quick Sort is a divide and conquer algorithm. It picks and element as pivot and partition the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways.
+The key process in quickSort is partition(). Target of partition is, given an array and an element x(say) of array as pivot, put x at it's correct position in sorted array and put all smaller elements (samller than x) before x, and put all greater elements (greater than x) after x. All this should be done in linear time
+| int main | +( | +) | ++ |
Driver program to test above functions
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
A buzz number is a number that is either divisible by 7 or has last digit as 7. +More...
+#include <iostream>+Functions | |
| int | main () |
A buzz number is a number that is either divisible by 7 or has last digit as 7.
+| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| +bool | operator() (MinHeapNode *l, MinHeapNode *r) |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| void | display () |
| stack () | |
| ~stack () | |
| bool | isEmptyStack () |
| void | push (Type item) |
| Type | top () |
| void | pop () |
| void | clear () |
| stack< Type > & | operator= (const stack< Type > &otherStack) |
+Private Attributes | |
| node< Type > * | stackTop |
| +int | size |
Default constructor
+ +
+
|
+ +inline | +
Clear stack
+
+
|
+ +inline | +
Show stack
+
+
|
+ +inline | +
Determine whether the stack is empty
+
+
|
+ +inline | +
Overload "=" the assignment operator
+
+
|
+ +inline | +
Remove the top element of the stack
+
+
|
+ +inline | +
Add new item to the stack
+
+
|
+ +inline | +
Pointer to the stack
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for node< Kind >, including all inherited members.
+| data (defined in node< Kind >) | node< Kind > | |
| data (defined in node< Kind >) | node< Kind > | |
| data (defined in node< Kind >) | node< Kind > | |
| height (defined in node< Kind >) | node< Kind > | |
| left (defined in node< Kind >) | node< Kind > | |
| left (defined in node< Kind >) | node< Kind > | |
| link (defined in node< Kind >) | node< Kind > | |
| next (defined in node< Kind >) | node< Kind > | |
| next (defined in node< Kind >) | node< Kind > | |
| next (defined in node< Kind >) | node< Kind > | |
| next (defined in node< Kind >) | node< Kind > | |
| node(int d) (defined in node< Kind >) | node< Kind > | inline |
| prev (defined in node< Kind >) | node< Kind > | |
| right (defined in node< Kind >) | node< Kind > | |
| right (defined in node< Kind >) | node< Kind > | |
| val (defined in node< Kind >) | node< Kind > |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Hash Search Algorithm - Best Time Complexity Ω(1) +More...
+#include <cstdlib>#include <iostream>+Classes | |
| struct | list |
+Macros | |
| +#define | MAX 6 |
| Determines how much data. | |
| +#define | HASHMAX 5 |
| Determines the length of the hash table. | |
+Typedefs | |
| typedef struct list | node |
| +typedef struct list * | link |
| pointer to nodes | |
+Functions | |
| int | h (int key) |
| void | create_list (int key) |
| int | hash_search (int key, int *counter) |
| int | main () |
+Variables | |
| +int | data [MAX] = {1, 10, 15, 5, 8, 7} |
| test data | |
| +node | hashtab [HASHMAX] |
| array of nodes | |
Hash Search Algorithm - Best Time Complexity Ω(1)
+In this algorithm, we use the method of division and reservation remainder to construct the hash function, and use the method of chain address to solve the conflict, that is, we link a chain list after the data, and store all the records whose keywords are synonyms in the same linear chain list.
+| void create_list | +( | +int | +key | ) | ++ |
The same after the remainder will be added after the same hash header To avoid conflict, zipper method is used Insert elements into the linked list in the header
| [in] | key | key to add to list |
n never gets freed. | int h | +( | +int | +key | ) | ++ |
Mode of hash detection : Division method
| [in] | key | to hash |
key | int hash_search | +( | +int | +key, | +
| + | + | int * | +counter | +
| + | ) | ++ |
Input the key to be searched, and get the hash header position through the H (int key) function, then one-dimensional linear search. If found
| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| MinHeap (int capacity) | |
| void | MinHeapify (int) |
| +int | parent (int i) |
| int | left (int i) |
| int | right (int i) |
| int | extractMin () |
| void | decreaseKey (int i, int new_val) |
| int | getMin () |
| void | deleteKey (int i) |
| void | insertKey (int k) |
+Private Attributes | |
| +int * | harr |
| pointer to array of elements in heap | |
| +int | capacity |
| maximum possible size of min heap | |
| +int | heap_size |
| Current number of elements in min heap. | |
A class for Min Heap
+| MinHeap::MinHeap | +( | +int | +cap | ) | ++ |
| void MinHeap::decreaseKey | +( | +int | +i, | +
| + | + | int | +new_val | +
| + | ) | ++ |
Decreases key value of key at index i to new_val
+Decreases value of key at index 'i' to new_val. It is assumed that new_val is smaller than harr[i].
+| void MinHeap::deleteKey | +( | +int | +i | ) | ++ |
Deletes a key stored at index i
+This function deletes key at index i. It first reduced value to minus infinite, then calls extractMin()
+| int MinHeap::extractMin | +( | +) | ++ |
to extract the root which is the minimum element
+
+
|
+ +inline | +
Returns the minimum key (key at root) from min heap
+| void MinHeap::insertKey | +( | +int | +k | ) | ++ |
Inserts a new key 'k'
+
+
|
+ +inline | +
| void MinHeap::MinHeapify | +( | +int | +i | ) | ++ |
to heapify a subtree with the root at given index
+A recursive method to heapify a subtree with the root at given index This method assumes that the subtrees are already heapified
+
+
|
+ +inline | +
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Faster computation for \(a^b\). +More...
+#include <cassert>#include <cmath>#include <cstdint>#include <cstdlib>#include <ctime>#include <iostream>+Functions | |
| template<typename T > | |
| double | fast_power_recursive (T a, T b) |
| template<typename T > | |
| double | fast_power_linear (T a, T b) |
| int | main () |
Faster computation for \(a^b\).
+Program that computes \(a^b\) in \(O(logN)\) time. It is based on formula that:
We can compute \(a^b\) recursively using above algorithm.
+| double fast_power_linear | +( | +T | +a, | +
| + | + | T | +b | +
| + | ) | ++ |
Same algorithm with little different formula. It still calculates in \(O(\log N)\)
+ +| double fast_power_recursive | +( | +T | +a, | +
| + | + | T | +b | +
| + | ) | ++ |
algorithm implementation for \(a^b\)
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
C++ program to implement Jump Search +More...
+#include <algorithm>#include <cmath>#include <iostream>+Functions | |
| int | jumpSearch (int arr[], int x, int n) |
| +int | main () |
C++ program to implement Jump Search
+| int jumpSearch | +( | +int | +arr[], | +
| + | + | int | +x, | +
| + | + | int | +n | +
| + | ) | ++ |
jump search implementation
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Attributes | |
| +int | values [10] |
| Values in the tower. | |
| +int | top |
| top tower ID | |
Define the state of tower
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
#include <queue.h>
+Public Member Functions | |
| void | display () |
| queue () | |
| ~queue () | |
| bool | isEmptyQueue () |
| void | enQueue (Kind item) |
| Kind | front () |
| void | deQueue () |
| void | clear () |
+Public Attributes | |
| +node * | t [100] |
| +int | front |
| +int | rear |
+Private Attributes | |
| node< Kind > * | queueFront |
| node< Kind > * | queueRear |
| +int | size |
Definition of the queue class
+Default constructor
+ +
+
|
+ +inline | +
Clear queue
+
+
|
+ +inline | +
Remove the top element of the queue
+
+
|
+ +inline | +
Show queue
+
+
|
+ +inline | +
Add new item to the queue
+
+
|
+ +inline | +
Return the first element of the queue
+ +
+
|
+ +inline | +
Determine whether the queue is empty
+Pointer to the front of the queue
+ +Pointer to the rear of the queue
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Functions to compute QR decomposition of any rectangular matrix. +More...
++Functions | |
| template<typename T > | |
| std::ostream & | operator<< (std::ostream &out, std::valarray< std::valarray< T >> const &v) |
| template<typename T > | |
| std::ostream & | operator<< (std::ostream &out, std::valarray< T > const &v) |
| template<typename T > | |
| double | vector_dot (const std::valarray< T > &a, const std::valarray< T > &b) |
| template<typename T > | |
| double | vector_mag (const std::valarray< T > &a) |
| template<typename T > | |
| std::valarray< T > | vector_proj (const std::valarray< T > &a, const std::valarray< T > &b) |
| template<typename T > | |
| void | qr_decompose (const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R) |
| std::valarray< double > | eigen_values (std::valarray< std::valarray< double >> *A, bool print_intermediates=false) |
Functions to compute QR decomposition of any rectangular matrix.
+| std::valarray<double> qr_algorithm::eigen_values | +( | +std::valarray< std::valarray< double >> * | +A, | +
| + | + | bool | +print_intermediates = false |
+
| + | ) | ++ |
Compute eigen values using iterative shifted QR decomposition algorithm as follows:
| [in,out] | A | matrix to compute eigen values for |
| [in] | print_intermediates | (optional) whether to print intermediate A, Q and R matrices (default = false) |
| std::ostream& qr_algorithm::operator<< | +( | +std::ostream & | +out, | +
| + | + | std::valarray< std::valarray< T >> const & | +v | +
| + | ) | ++ |
operator to print a matrix
+| std::ostream& qr_algorithm::operator<< | +( | +std::ostream & | +out, | +
| + | + | std::valarray< T > const & | +v | +
| + | ) | ++ |
operator to print a vector
+| void qr_algorithm::qr_decompose | +( | +const std::valarray< std::valarray< T >> & | +A, | +
| + | + | std::valarray< std::valarray< T >> * | +Q, | +
| + | + | std::valarray< std::valarray< T >> * | +R | +
| + | ) | ++ |
Decompose matrix \(A\) using Gram-Schmidt process.
++\begin{eqnarray*} \text{given that}\quad A &=& *\left[\mathbf{a}_1,\mathbf{a}_2,\ldots,\mathbf{a}_{N-1},\right]\\ \text{where}\quad\mathbf{a}_i &=& \left[a_{0i},a_{1i},a_{2i},\ldots,a_{(M-1)i}\right]^T\quad\ldots\mbox{(column vectors)}\\ \text{then}\quad\mathbf{u}_i &=& \mathbf{a}_i *-\sum_{j=0}^{i-1}\text{proj}_{\mathbf{u}_j}\mathbf{a}_i\\ \mathbf{e}_i &=&\frac{\mathbf{u}_i}{\left|\mathbf{u}_i\right|}\\ Q &=& \begin{bmatrix}\mathbf{e}_0 & \mathbf{e}_1 & \mathbf{e}_2 & \dots & \mathbf{e}_{N-1}\end{bmatrix}\\ R &=& \begin{bmatrix}\langle\mathbf{e}_0\,,\mathbf{a}_0\rangle & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots \\ 0 & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\ 0 & 0 & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\ \vdots & \vdots & \vdots & \ddots \end{bmatrix}\\ \end{eqnarray*} +
+| A | input matrix to decompose |
| Q | output decomposed matrix |
| R | output decomposed matrix |
+
|
+ +inline | +
Compute dot product of two vectors of equal lengths
+If \(\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\) and \(\vec{b}=\left[b_0,b_1,b_1,...,b_L\right]\) then \(\vec{a}\cdot\vec{b}=\displaystyle\sum_{i=0}^L a_i\times b_i\)
+
+
|
+ +inline | +
Compute magnitude of vector.
+If \(\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\) then \(\left|\vec{a}\right|=\sqrt{\displaystyle\sum_{i=0}^L a_i^2}\)
+| std::valarray<T> qr_algorithm::vector_proj | +( | +const std::valarray< T > & | +a, | +
| + | + | const std::valarray< T > & | +b | +
| + | ) | ++ |
Compute projection of vector \(\vec{a}\) on \(\vec{b}\) defined as
+\[\text{proj}_\vec{b}\vec{a}=\frac{\vec{a}\cdot\vec{b}}{\left|\vec{b}\right|^2}\vec{b}\] +
+check for division by zero using machine epsilon
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| +void | enqueue (int) |
| +int | dequeue () |
| +void | display () |
+Public Attributes | |
| +linkedlist * | front |
| +linkedlist * | rear |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Statistical algorithms. +More...
++Classes | |
| class | stats_computer1 |
| class | stats_computer2 |
Statistical algorithms.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method +More...
+#include <cmath>#include <ctime>#include <fstream>#include <iostream>#include <valarray>+Functions | |
| void | problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Problem statement for a system with first-order differential equations. Updates the system differential variables. More... | |
| void | exact_solution (const double &x, std::valarray< double > *y) |
| Exact solution of the problem. Used for solution comparison. More... | |
| void | semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Compute next step approximation using the semi-implicit-Euler method. More... | |
| double | semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false) |
| Compute approximation using the semi-implicit-Euler method in the given limits. More... | |
| void | save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0) |
| int | main (int argc, char *argv[]) |
Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method
+ +The ODE being solved is:
+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*} +
+The exact solution for the above problem is:
+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*} +
+ The computation results are stored to a text file semi_implicit_euler.csv and the exact soltuion results in exact.csv for comparison.
To implement Van der Pol oscillator, change the problem function to:
| void exact_solution | +( | +const double & | +x, | +
| + | + | std::valarray< double > * | +y | +
| + | ) | ++ |
| int main | +( | +int | +argc, | +
| + | + | char * | +argv[] | +
| + | ) | ++ |
Main Function
+| void problem | +( | +const double & | +x, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | std::valarray< double > * | +dy | +
| + | ) | ++ |
Problem statement for a system with first-order differential equations. Updates the system differential variables.
+| [in] | x | independent variable(s) |
| [in,out] | y | dependent variable(s) |
| [in,out] | dy | first-derivative of dependent variable(s) |
| void save_exact_solution | +( | +const double & | +X0, | +
| + | + | const double & | +X_MAX, | +
| + | + | const double & | +step_size, | +
| + | + | const std::valarray< double > & | +Y0 | +
| + | ) | ++ |
Function to compute and save exact solution for comparison
+| [in] | X0 | initial value of independent variable |
| [in] | X_MAX | final value of independent variable |
| [in] | step_size | independent variable step size |
| [in] | Y0 | initial values of dependent variables |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
#include <iostream>+Functions | |
| int | main () |
A sparse matrix is a matrix which has number of zeroes greater than \(\frac{m\times n}{2}\), where m and n are the dimensions of the matrix.
+| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Program to compute the QR decomposition of a given matrix. +More...
+#include <array>#include <cmath>#include <cstdlib>#include <ctime>#include <iostream>#include "./qr_decompose.h"+Functions | |
| int | main (void) |
Program to compute the QR decomposition of a given matrix.
+ +| int main | +( | +void | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
A simple tree implementation using structured nodes. +More...
+#include <iostream>+Classes | |
| class | node< Kind > |
| class | queue< Kind > |
+Functions | |
| +void | enqueue (node *n) |
| +node * | dequeue () |
| +void | Insert (node *n, int x) |
| +int | findMaxInLeftST (node *n) |
| +void | Remove (node *p, node *n, int x) |
| +void | BFT (node *n) |
| +void | Pre (node *n) |
| +void | In (node *n) |
| +void | Post (node *n) |
| +int | main () |
+Variables | |
| +queue | q |
A simple tree implementation using structured nodes.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
A C++ program to demonstrate working of std::sort(), std::reverse() +More...
+#include <algorithm>#include <iostream>#include <numeric>#include <vector>+Functions | |
| int | main () |
A C++ program to demonstrate working of std::sort(), std::reverse()
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
String pattern search - brute force. +More...
+#include <iostream>#include <cstring>#include <vector>+Namespaces | |
| string_search | |
| String search algorithms. | |
+Functions | |
| int | string_search::brute_force (const std::string &text, const std::string &pattern) |
| int | main () |
+Variables | |
| const std::vector< std::vector< std::string > > | test_set |
String pattern search - brute force.
+| int main | +( | +) | ++ |
Main function
+| const std::vector<std::vector<std::string> > test_set | +
set of test cases
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for statistics::stats_computer2< T >, including all inherited members.
+| M (defined in statistics::stats_computer2< T >) | statistics::stats_computer2< T > | private |
| mean() const | statistics::stats_computer2< T > | inline |
| mu (defined in statistics::stats_computer2< T >) | statistics::stats_computer2< T > | private |
| n (defined in statistics::stats_computer2< T >) | statistics::stats_computer2< T > | private |
| new_val(T x) | statistics::stats_computer2< T > | inline |
| operator>>(std::istream &input, stats_computer2 &stat) | statistics::stats_computer2< T > | friend |
| std() const | statistics::stats_computer2< T > | inline |
| var (defined in statistics::stats_computer2< T >) | statistics::stats_computer2< T > | private |
| variance() const | statistics::stats_computer2< T > | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Static Public Member Functions | |
| static bool | isCyclicDFS (Graph const &graph) |
| static bool | isCyclicBFS (Graph const &graph) |
+Private Types | |
| enum | nodeStates : uint8_t { not_visited = 0, +in_stack, +visited + } |
+Static Private Member Functions | |
| static bool | isCyclicDFSHelper (AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node) |
+
|
+ +inlinestatic | +
Check if a graph has cycle or not.
+This function uses BFS to check if a graph is cyclic or not.
+| graph | which needs to be evaluated for the presence of cycle. |
+
|
+ +inlinestatic | +
Driver function to check if a graph has a cycle.
+This function uses DFS to check for cycle in the graph.
+| graph | which needs to be evaluated for the presence of cycle. |
State of the node.
+It is a vector of "nodeStates" which represents the state node is in. It can take only 3 values: "not_visited", "in_stack", and "visited".
+Initially, all nodes are in "not_visited" state.
+
+
|
+ +inlinestaticprivate | +
Helper function of "isCyclicDFS".
+| adjList | is the adjacency list representation of some graph. |
| state | is the state of the nodes of the graph. |
| node | is the node being evaluated. |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Linked list implementation using Arrays. +More...
+#include <iostream>+Classes | |
| class | Node |
+Functions | |
| +void | initialise_list () |
| int | getnode () |
| void | freeNode (int nodeToBeDeleted) |
| void | insertAtTheBeginning (int data) |
| +void | insertAtTheEnd (int data) |
| +void | display () |
| int | main () |
+Variables | |
| +Node | AvailArray [100] |
| array that will act as nodes of a linked list. | |
| +int | head = -1 |
| +int | avail = 0 |
Linked list implementation using Arrays.
+The difference between the pointer implementation of linked list and array implementation of linked list:
| void freeNode | +( | +int | +nodeToBeDeleted | ) | ++ |
This function when called will delete the node with the index presented as an argument, and will put back that node into the array.
+ +| int getnode | +( | +) | ++ |
This will return the index of the first free node present in the avail list
+| void insertAtTheBeginning | +( | +int | +data | ) | ++ |
The function will insert the given data into the front of the linked list.
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Bit, including all inherited members.
+| bit (defined in Bit) | Bit | private |
| Bit(vector< int > &arr) (defined in Bit) | Bit | inline |
| Bit(int x) (defined in Bit) | Bit | inline |
| n (defined in Bit) | Bit | private |
| offset(int x) (defined in Bit) | Bit | inlineprivate |
| sum(int id) (defined in Bit) | Bit | inline |
| sum_range(int l, int r) (defined in Bit) | Bit | inline |
| update(int id, int val) (defined in Bit) | Bit | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for MinHeap, including all inherited members.
+| capacity | MinHeap | private |
| decreaseKey(int i, int new_val) | MinHeap | |
| deleteKey(int i) | MinHeap | |
| extractMin() | MinHeap | |
| getMin() | MinHeap | inline |
| harr | MinHeap | private |
| heap_size | MinHeap | private |
| insertKey(int k) | MinHeap | |
| left(int i) | MinHeap | inline |
| MinHeap(int capacity) | MinHeap | |
| MinHeapify(int) | MinHeap | |
| parent(int i) (defined in MinHeap) | MinHeap | inline |
| right(int i) | MinHeap | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
#include <cassert>#include <iostream>+Functions | |
| unsigned int | gcd (unsigned int x, unsigned int y) |
| unsigned int | lcm (unsigned int x, unsigned int y) |
| void | tests () |
| int | main () |
Copyright 2020
+A basic implementation of LCM function
+| unsigned int gcd | +( | +unsigned int | +x, | +
| + | + | unsigned int | +y | +
| + | ) | ++ |
Function for finding greatest common divisor of two numbers. @params two integers x and y whose gcd we want to find.
| unsigned int lcm | +( | +unsigned int | +x, | +
| + | + | unsigned int | +y | +
| + | ) | ++ |
Function for finding the least common multiple of two numbers. @params integer x and y whose lcm we want to find.
| int main | +( | +) | ++ |
Main function
+| void tests | +( | +) | ++ |
Function for testing the lcm() functions with some assert statements.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Faster computation of Fibonacci series. +More...
+#include <cinttypes>#include <cstdio>#include <iostream>+Functions | |
| uint64_t | fib (uint64_t n) |
| int | main () |
+Variables | |
| const uint64_t | MAX = 93 |
| uint64_t | f [MAX] = {0} |
Faster computation of Fibonacci series.
+An efficient way to calculate nth fibonacci number faster and simpler than \(O(n\log n)\) method of matrix exponentiation This works by using both recursion and dynamic programming. as 93rd fibonacci exceeds 19 digits, which cannot be stored in a single long long variable, we can only use it till 92nd fibonacci we can use it for 10000th fibonacci etc, if we implement bigintegers. This algorithm works with the fact that nth fibonacci can easily found if we have already found n/2th or (n+1)/2th fibonacci It is a property of fibonacci similar to matrix exponentiation.
+ + +| uint64_t fib | +( | +uint64_t | +n | ) | ++ |
Algorithm
+| int main | +( | +) | ++ |
| uint64_t f[MAX] = {0} | +
Array of computed fibonacci numbers
+ +| const uint64_t MAX = 93 | +
maximum number that can be computed - The result after 93 cannot be stored in a uint64_t data type.
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm +More...
+#include <iostream>+Functions | |
| int | gcd (int num1, int num2) |
| int | main () |
Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm
+ +| int gcd | +( | +int | +num1, | +
| + | + | int | +num2 | +
| + | ) | ++ |
algorithm
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Library functions to compute QR decomposition of a given matrix. +More...
+#include <cmath>#include <cstdlib>#include <iomanip>#include <iostream>#include <limits>#include <numeric>#include <valarray>Go to the source code of this file.
++Namespaces | |
| qr_algorithm | |
| Functions to compute QR decomposition of any rectangular matrix. | |
+Functions | |
| template<typename T > | |
| std::ostream & | qr_algorithm::operator<< (std::ostream &out, std::valarray< std::valarray< T >> const &v) |
| template<typename T > | |
| std::ostream & | qr_algorithm::operator<< (std::ostream &out, std::valarray< T > const &v) |
| template<typename T > | |
| double | qr_algorithm::vector_dot (const std::valarray< T > &a, const std::valarray< T > &b) |
| template<typename T > | |
| double | qr_algorithm::vector_mag (const std::valarray< T > &a) |
| template<typename T > | |
| std::valarray< T > | qr_algorithm::vector_proj (const std::valarray< T > &a, const std::valarray< T > &b) |
| template<typename T > | |
| void | qr_algorithm::qr_decompose (const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R) |
Library functions to compute QR decomposition of a given matrix.
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Entry, including all inherited members.
+| Entry(int key=notPresent) (defined in Entry) | Entry | inlineexplicit |
| Entry(int key=notPresent) (defined in Entry) | Entry | inlineexplicit |
| Entry(int key=notPresent) (defined in Entry) | Entry | inlineexplicit |
| key (defined in Entry) | Entry |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Shell sort algorithm +More...
+#include <cassert>#include <cstdlib>#include <ctime>#include <iostream>#include <utility>#include <vector>+Namespaces | |
| sorting | |
| Sorting algorithms. | |
+Functions | |
| template<class T > | |
| void | show_data (T *arr, size_t LEN) |
| template<typename T , size_t N> | |
| void | show_data (T(&arr)[N]) |
| template<typename T > | |
| void | sorting::shell_sort (T *arr, size_t LEN) |
| template<typename T , size_t N> | |
| void | sorting::shell_sort (T(&arr)[N]) |
| template<typename T > | |
| void | sorting::shell_sort (std::vector< T > *arr) |
| template<typename T > | |
| int | compare (const void *a, const void *b) |
| void | test_int (const int NUM_DATA) |
| void | test_f (const int NUM_DATA) |
| int | main (int argc, char *argv[]) |
Shell sort algorithm
+ +| int compare | +( | +const void * | +a, | +
| + | + | const void * | +b | +
| + | ) | ++ |
function to compare sorting using cstdlib's qsort
+| int main | +( | +int | +argc, | +
| + | + | char * | +argv[] | +
| + | ) | ++ |
Main function
+| void show_data | +( | +T * | +arr, | +
| + | + | size_t | +LEN | +
| + | ) | ++ |
| void show_data | +( | +T(&) | +arr[N] | ) | ++ |
pretty print array
| [in] | arr | array to print |
| [in] | N | length of array to print |
| void test_f | +( | +const int | +NUM_DATA | ) | ++ |
Test implementation of shell_sort on float arrays by comparing results against std::qsort.
+| void test_int | +( | +const int | +NUM_DATA | ) | ++ |
Test implementation of shell_sort on integer arrays by comparing results against std::qsort.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Library to perform arithmatic operations on arbitrarily large numbers. +More...
+#include <algorithm>#include <cassert>#include <cinttypes>#include <cstring>#include <iostream>#include <type_traits>#include <vector>Go to the source code of this file.
++Classes | |
| class | large_number |
Library to perform arithmatic operations on arbitrarily large numbers.
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute prime numbers upto 1 billion. +More...
+#include <cstring>#include <iostream>+Functions | |
| void | Sieve (int64_t n) |
| int | main () |
+Variables | |
| char | prime [100000000] |
Compute prime numbers upto 1 billion.
+ +| int main | +( | +) | ++ |
| void Sieve | +( | +int64_t | +n | ) | ++ |
Perform Sieve algorithm
+| char prime[100000000] | +
array to store the primes
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm +More...
+#include <iostream>#include <stdexcept>+Functions | |
| int | gcd (int num1, int num2) |
| int | main () |
Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm
+ +| int gcd | +( | +int | +num1, | +
| + | + | int | +num2 | +
| + | ) | ++ |
algorithm
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| +void | createNode (int val) |
| +void | enqueue (int val) |
| +void | dequeue () |
| +void | traverse () |
+Private Attributes | |
| +node * | front |
| +node * | rear |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| +bool | intersect (Point first_point, Point second_point, Point third_point, Point forth_point) |
| int | direction (Point first_point, Point second_point, Point third_point) |
| bool | on_segment (Point first_point, Point second_point, Point third_point) |
intersect returns true if segments of two line intersects and false if they do not. It calls the subroutines direction which computes the orientation.
+
+
|
+ +inline | +
We will find direction of line here respect to @first_point. Here @second_point and @third_point is first and second points of the line respectively. we want a method to determine which way a given angle these three points turns. If returned number is negative, then the angle is counter-clockwise. That means the line is going to right to left. We will fount angle as clockwise if the method returns positive number.
+ +
+
|
+ +inline | +
This method determines whether a point known to be colinear with a segment lies on that segment.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for MinHeapNode, including all inherited members.
+| data (defined in MinHeapNode) | MinHeapNode | |
| freq (defined in MinHeapNode) | MinHeapNode | |
| left (defined in MinHeapNode) | MinHeapNode | |
| MinHeapNode(char data, unsigned freq) (defined in MinHeapNode) | MinHeapNode | inline |
| right (defined in MinHeapNode) | MinHeapNode |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Read integers from stdin continuously as they are entered without waiting for the \n character.
+More...
#include <iostream>+Functions | |
| void | fastinput (int *number) |
| int | main () |
Read integers from stdin continuously as they are entered without waiting for the \n character.
| void fastinput | +( | +int * | +number | ) | ++ |
Function to read the number from stdin. The function reads input until a non numeric character is entered.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Kohonen self organizing map (topological map) +More...
+#include <algorithm>#include <cmath>#include <cstdlib>#include <ctime>#include <fstream>#include <iostream>#include <valarray>#include <vector>+Namespaces | |
| machine_learning | |
| Machine learning algorithms. | |
+Macros | |
| +#define | _USE_MATH_DEFINES |
| +#define | MIN_DISTANCE 1e-4 |
| Minimum average distance of image nodes. | |
+Functions | |
| double | _random (double a, double b) |
| int | save_2d_data (const char *fname, const std::vector< std::valarray< double >> &X) |
| void | get_min_2d (const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx) |
| int | machine_learning::save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double >>> &W) |
| double | machine_learning::update_weights (const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R) |
| void | machine_learning::kohonen_som (const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min) |
| void | test_2d_classes (std::vector< std::valarray< double >> *data) |
| void | test1 () |
| void | test_3d_classes1 (std::vector< std::valarray< double >> *data) |
| void | test2 () |
| void | test_3d_classes2 (std::vector< std::valarray< double >> *data) |
| void | test3 () |
| double | get_clock_diff (clock_t start_t, clock_t end_t) |
| int | main (int argc, char **argv) |
Kohonen self organizing map (topological map)
+ +| double get_clock_diff | +( | +clock_t | +start_t, | +
| + | + | clock_t | +end_t | +
| + | ) | ++ |
| int main | +( | +int | +argc, | +
| + | + | char ** | +argv | +
| + | ) | ++ |
Main function
+| void test1 | +( | +) | ++ |
Test that creates a random set of points distributed in four clusters in circumference of a circle and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:
test1.csv: random test samples points with a circular patternw11.csv: initial random mapw12.csv: trained SOM map | void test2 | +( | +) | ++ |
Test that creates a random set of points distributed in 4 clusters in 3D space and trains an SOM that finds the topological pattern. The following CSV files are created to validate the execution:
test2.csv: random test samples points with a lamniscate patternw21.csv: initial random mapw22.csv: trained SOM map | void test3 | +( | +) | ++ |
Test that creates a random set of points distributed in eight clusters in 3D space and trains an SOM that finds the topological pattern. The following CSV files are created to validate the execution:
test3.csv: random test samples points with a circular patternw31.csv: initial random mapw32.csv: trained SOM map | void test_2d_classes | +( | +std::vector< std::valarray< double >> * | +data | ) | ++ |
Creates a random set of points distributed in four clusters in 3D space with centroids at the points
| [out] | data | matrix to store data in |
| void test_3d_classes1 | +( | +std::vector< std::valarray< double >> * | +data | ) | ++ |
Creates a random set of points distributed in four clusters in 3D space with centroids at the points
| [out] | data | matrix to store data in |
| void test_3d_classes2 | +( | +std::vector< std::valarray< double >> * | +data | ) | ++ |
Creates a random set of points distributed in four clusters in 3D space with centroids at the points
| [out] | data | matrix to store data in |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Protected Attributes | |
| +node * | head |
| +int | total |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| + | MinHeapNode (char data, unsigned freq) |
+Public Attributes | |
| +char | data |
| +unsigned | freq |
| +MinHeapNode * | left |
| +MinHeapNode * | right |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
#include <iostream>+Functions | |
| double | bayes_AgivenB (double BgivenA, double A, double B) |
| double | bayes_BgivenA (double AgivenB, double A, double B) |
| int | main () |
Bayes' theorem allows one to find \(P(A|B)\) given \(P(B|A)\) or \(P(B|A)\) given \(P(A|B)\) and \(P(A)\) and \(P(B)\).
+Note that \(P(A|B)\) is read 'The probability of A given that the event B has occured'.
| double bayes_AgivenB | +( | +double | +BgivenA, | +
| + | + | double | +A, | +
| + | + | double | +B | +
| + | ) | ++ |
| double bayes_BgivenA | +( | +double | +AgivenB, | +
| + | + | double | +A, | +
| + | + | double | +B | +
| + | ) | ++ |
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Sorting algorithms. +More...
++Functions | |
| template<class Iterator > | |
| void | merge (Iterator l, Iterator r, const Iterator e, char b[]) |
| merges 2 sorted adjacent segments into a larger sorted segment More... | |
| template<class Iterator > | |
| void | non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n) |
| bottom-up merge sort which sorts elements in a non-decreasing order More... | |
| template<class Iterator > | |
| void | non_recursive_merge_sort (const Iterator first, const size_t n) |
| bottom-up merge sort which sorts elements in a non-decreasing order More... | |
| template<class Iterator > | |
| void | non_recursive_merge_sort (const Iterator first, const Iterator last) |
| bottom-up merge sort which sorts elements in a non-decreasing order More... | |
| int | partition (int arr[], int low, int high) |
| void | quickSort (int arr[], int low, int high) |
| template<typename T > | |
| void | shell_sort (T *arr, size_t LEN) |
| template<typename T , size_t N> | |
| void | shell_sort (T(&arr)[N]) |
| template<typename T > | |
| void | shell_sort (std::vector< T > *arr) |
Sorting algorithms.
+| void sorting::merge | +( | +Iterator | +l, | +
| + | + | Iterator | +r, | +
| + | + | const Iterator | +e, | +
| + | + | char | +b[] | +
| + | ) | ++ |
merges 2 sorted adjacent segments into a larger sorted segment
+best-case = worst-case = O(n)
| l | points to the left part |
| r | points to the right part, end of left part |
| e | points to end of right part |
| b | points at the buffer |
| void sorting::non_recursive_merge_sort | +( | +const Iterator | +first, | +
| + | + | const Iterator | +last | +
| + | ) | ++ |
bottom-up merge sort which sorts elements in a non-decreasing order
+| first | points to the first element |
| last | points to 1-step past the last element |
| void sorting::non_recursive_merge_sort | +( | +const Iterator | +first, | +
| + | + | const Iterator | +last, | +
| + | + | const size_t | +n | +
| + | ) | ++ |
bottom-up merge sort which sorts elements in a non-decreasing order
+sorts elements non-recursively by breaking them into small segments, merging adjacent segments into larger sorted segments, then increasing the sizes of segments by factors of 2 and repeating the same process. best-case = worst-case = O(n log(n))
| first | points to the first element |
| last | points to 1-step past the last element |
| n | the number of elements |
| void sorting::non_recursive_merge_sort | +( | +const Iterator | +first, | +
| + | + | const size_t | +n | +
| + | ) | ++ |
bottom-up merge sort which sorts elements in a non-decreasing order
+| first | points to the first element |
| n | the number of elements |
| int sorting::partition | +( | +int | +arr[], | +
| + | + | int | +low, | +
| + | + | int | +high | +
| + | ) | ++ |
This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot
+| void sorting::quickSort | +( | +int | +arr[], | +
| + | + | int | +low, | +
| + | + | int | +high | +
| + | ) | ++ |
The main function that implements QuickSort arr[] --> Array to be sorted, low --> Starting index, high --> Ending index
+| void sorting::shell_sort | +( | +std::vector< T > * | +arr | ) | ++ |
function overload - when input array is of type std::vector, simply send the data content and the data length to the above function.
+| void sorting::shell_sort | +( | +T * | +arr, | +
| + | + | size_t | +LEN | +
| + | ) | ++ |
Optimized algorithm - takes half the time by utilizing Mar
+| void sorting::shell_sort | +( | +T(&) | +arr[N] | ) | ++ |
function overload - when input array is of a known length array type
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
#include <queue.h>
+Public Member Functions | |
| + | node (int d) |
+Public Attributes | |
| +int | data |
| +int | height |
| +struct node * | left |
| +struct node * | right |
| +int | val |
| +node * | left |
| +node * | right |
| +struct node * | next |
| +node * | next |
| +node * | prev |
| +Kind | data |
| +node< Kind > * | next |
| +Type | data |
| +node< Type > * | next |
| +node * | link |
Definition of the node
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Adaptive Linear Neuron (ADALINE) implementation +More...
+#include <cassert>#include <climits>#include <cmath>#include <cstdlib>#include <ctime>#include <iostream>#include <numeric>#include <vector>+Classes | |
| class | machine_learning::adaline |
+Namespaces | |
| machine_learning | |
| Machine learning algorithms. | |
+Macros | |
| +#define | MAX_ITER 500 |
+Functions | |
| void | test1 (double eta=0.01) |
| void | test2 (double eta=0.01) |
| void | test3 (double eta=0.01) |
| int | main (int argc, char **argv) |
Adaptive Linear Neuron (ADALINE) implementation
+ +
source ADALINE is one of the first and simplest single layer artificial neural network. The algorithm essentially implements a linear function
+\[ f\left(x_0,x_1,x_2,\ldots\right) = \sum_j x_jw_j+\theta \] +
+where \(x_j\) are the input features of a sample, \(w_j\) are the coefficients of the linear function and \(\theta\) is a constant. If we know the \(w_j\), then for any given set of features, \(y\) can be computed. Computing the \(w_j\) is a supervised learning algorithm wherein a set of features and their corresponding outputs are given and weights are computed using stochastic gradient descent method.
+| int main | +( | +int | +argc, | +
| + | + | char ** | +argv | +
| + | ) | ++ |
Main function
+| void test1 | +( | +double | +eta = 0.01 | ) | ++ |
test function to predict points in a 2D coordinate system above the line \(x=y\) as +1 and others as -1. Note that each point is defined by 2 values or 2 features.
| [in] | eta | learning rate (optional, default=0.01) |
| void test2 | +( | +double | +eta = 0.01 | ) | ++ |
test function to predict points in a 2D coordinate system above the line \(x+3y=-1\) as +1 and others as -1. Note that each point is defined by 2 values or 2 features. The function will create random sample points for training and test purposes.
| [in] | eta | learning rate (optional, default=0.01) |
| void test3 | +( | +double | +eta = 0.01 | ) | ++ |
test function to predict points in a 3D coordinate system lying within the sphere of radius 1 and centre at origin as +1 and others as -1. Note that each point is defined by 3 values but we use 6 features. The function will create random sample points for training and test purposes. The sphere centred at origin and radius 1 is defined as: \(x^2+y^2+z^2=r^2=1\) and if the \(r^2<1\), point lies within the sphere else, outside.
+| [in] | eta | learning rate (optional, default=0.01) |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for lca, including all inherited members.
+| adj (defined in lca) | lca | |
| build() (defined in lca) | lca | inline |
| dfs(int node, int par) (defined in lca) | lca | inline |
| lca(int n_) (defined in lca) | lca | inline |
| level (defined in lca) | lca | |
| n (defined in lca) | lca | |
| query(int u, int v) (defined in lca) | lca | inline |
| up (defined in lca) | lca | |
| verify() (defined in lca) | lca | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This program is use to print the following pattern. +More...
+#include <iostream>+Functions | |
| int | main () |
This program is use to print the following pattern.
++ \*\* + \*\* + \*\*\*\* + \*\*\*\* + \*\*\*\*\*\* + \*\*\*\*\*\* +\*\*\*\*\*\*\*\* +
where number of pairs line is given by user
+| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| adaline (int num_features, const double eta=0.01f, const double accuracy=1e-5) | |
| int | predict (const std::vector< double > &x, double *out=nullptr) |
| double | fit (const std::vector< double > &x, const int &y) |
| template<int N> | |
| void | fit (std::vector< double > const (&X)[N], const int *y) |
| +int | activation (double x) |
+Private Member Functions | |
| bool | check_size_match (const std::vector< double > &x) |
+Private Attributes | |
| +const double | eta |
| learning rate of the algorithm | |
| +const double | accuracy |
| model fit convergence accuracy | |
| +std::vector< double > | weights |
| weights of the neural network | |
+Friends | |
| std::ostream & | operator<< (std::ostream &out, const adaline &ada) |
+
|
+ +inline | +
Default constructor
| [in] | num_features | number of features present |
| [in] | eta | learning rate (optional, default=0.1) |
| [in] | convergence | accuracy (optional, default= \(1\times10^{-5}\)) |
+
|
+ +inlineprivate | +
convenient function to check if input feature vector size matches the model weights size
| [in] | x | fecture vector to check |
true size matches false size does not match
+
|
+ +inline | +
Update the weights of the model using supervised learning for one feature vector
| [in] | x | feature vector |
| [in] | y | known output value |
+
|
+ +inline | +
Update the weights of the model using supervised learning for an array of vectors.
| [in] | X | array of feature vector |
| [in] | y | known output value for each feature vector |
+
|
+ +inline | +
predict the output of the model for given set of features
| [in] | x | input vector |
| [out] | out | optional argument to return neuron output before applying activation function (optional, nullptr to ignore) |
+
|
+ +friend | +
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Addition rule of probabilities. +More...
+#include <iostream>+Functions | |
| double | addition_rule_independent (double A, double B) |
| double | addition_rule_dependent (double A, double B, double B_given_A) |
| int | main () |
Addition rule of probabilities.
+| double addition_rule_dependent | +( | +double | +A, | +
| + | + | double | +B, | +
| + | + | double | +B_given_A | +
| + | ) | ++ |
Calculates the probability of the events A or B for dependent events note that if value of B_given_A is unknown, use chainrule to find it \parama [in] A probability of event A \parama [in] B probability of event B \parama [in] B_given_A probability of event B condition A
| double addition_rule_independent | +( | +double | +A, | +
| + | + | double | +B | +
| + | ) | ++ |
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Functions | |
| void | forward_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Compute next step approximation using the forward-Euler method. More... | |
| double | forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false) |
| Compute approximation using the forward-Euler method in the given limits. More... | |
| void | midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Compute next step approximation using the midpoint-Euler method. More... | |
| double | midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false) |
| Compute approximation using the midpoint-Euler method in the given limits. More... | |
| void | semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Compute next step approximation using the semi-implicit-Euler method. More... | |
| double | semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false) |
| Compute approximation using the semi-implicit-Euler method in the given limits. More... | |
Integration functions for implementations with solving ordinary differential equations (ODEs) of any order and and any number of independent variables.
+| double forward_euler | +( | +double | +dx, | +
| + | + | double | +x0, | +
| + | + | double | +x_max, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | bool | +save_to_file = false |
+
| + | ) | ++ |
Compute approximation using the forward-Euler method in the given limits.
+| [in] | dx | step size |
| [in] | x0 | initial value of independent variable |
| [in] | x_max | final value of independent variable |
| [in,out] | y | take \(y_n\) and compute \(y_{n+1}\) |
| [in] | save_to_file | flag to save results to a CSV file (1) or not (0) |
| void forward_euler_step | +( | +const double | +dx, | +
| + | + | const double & | +x, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | std::valarray< double > * | +dy | +
| + | ) | ++ |
Compute next step approximation using the forward-Euler method.
++\[y_{n+1}=y_n + dx\cdot f\left(x_n,y_n\right)\] +
+| [in] | dx | step size |
| [in] | x | take \(x_n\) and compute \(x_{n+1}\) |
| [in,out] | y | take \(y_n\) and compute \(y_{n+1}\) |
| [in,out] | dy | compute \(f\left(x_n,y_n\right)\) |
| double midpoint_euler | +( | +double | +dx, | +
| + | + | double | +x0, | +
| + | + | double | +x_max, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | bool | +save_to_file = false |
+
| + | ) | ++ |
Compute approximation using the midpoint-Euler method in the given limits.
+| [in] | dx | step size |
| [in] | x0 | initial value of independent variable |
| [in] | x_max | final value of independent variable |
| [in,out] | y | take \(y_n\) and compute \(y_{n+1}\) |
| [in] | save_to_file | flag to save results to a CSV file (1) or not (0) |
| void midpoint_euler_step | +( | +const double | +dx, | +
| + | + | const double & | +x, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | std::valarray< double > * | +dy | +
| + | ) | ++ |
Compute next step approximation using the midpoint-Euler method.
++\[y_{n+1} = y_n + dx\, f\left(x_n+\frac{1}{2}dx, y_n + \frac{1}{2}dx\,f\left(x_n,y_n\right)\right)\] +
+| [in] | dx | step size |
| [in] | x | take \(x_n\) and compute \(x_{n+1}\) |
| [in,out] | y | take \(y_n\) and compute \(y_{n+1}\) |
| [in,out] | dy | compute \(f\left(x_n,y_n\right)\) |
| double semi_implicit_euler | +( | +double | +dx, | +
| + | + | double | +x0, | +
| + | + | double | +x_max, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | bool | +save_to_file = false |
+
| + | ) | ++ |
Compute approximation using the semi-implicit-Euler method in the given limits.
+| [in] | dx | step size |
| [in] | x0 | initial value of independent variable |
| [in] | x_max | final value of independent variable |
| [in,out] | y | take \(y_n\) and compute \(y_{n+1}\) |
| [in] | save_to_file | flag to save results to a CSV file (1) or not (0) |
| void semi_implicit_euler_step | +( | +const double | +dx, | +
| + | + | const double & | +x, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | std::valarray< double > * | +dy | +
| + | ) | ++ |
Compute next step approximation using the semi-implicit-Euler method.
++\[y_{n+1}=y_n + dx\cdot f\left(x_n,y_n\right)\] +
+| [in] | dx | step size |
| [in] | x | take \(x_n\) and compute \(x_{n+1}\) |
| [in,out] | y | take \(y_n\) and compute \(y_{n+1}\) |
| [in,out] | dy | compute \(f\left(x_n,y_n\right)\) |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute factorial of any arbitratily large number/. +More...
++Functions | |
| bool | test1 () |
| bool | test2 () |
| int | main (int argc, char *argv[]) |
Compute factorial of any arbitratily large number/.
+ +| int main | +( | +int | +argc, | +
| + | + | char * | +argv[] | +
| + | ) | ++ |
Main program
+| bool test1 | +( | +) | ++ |
Test implementation for 10! Result must be 3628800.
| bool test2 | +( | +) | ++ |
Test implementation for 100! The result is the 156 digit number:
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Binomial distribution example +More...
+#include <cmath>#include <iostream>+Functions | |
| double | binomial_expected (double n, double p) |
| double | binomial_variance (double n, double p) |
| double | binomial_standard_deviation (double n, double p) |
| double | nCr (double n, double r) |
| double | binomial_x_successes (double n, double p, double x) |
| double | binomial_range_successes (double n, double p, double lower_bound, double upper_bound) |
| int | main () |
Binomial distribution example
+The binomial distribution models the number of successes in a sequence of n independent events
+Summary of variables used:
| double binomial_expected | +( | +double | +n, | +
| + | + | double | +p | +
| + | ) | ++ |
| double binomial_range_successes | +( | +double | +n, | +
| + | + | double | +p, | +
| + | + | double | +lower_bound, | +
| + | + | double | +upper_bound | +
| + | ) | ++ |
calculates the probability of a result within a range (inclusive, inclusive)
| double binomial_standard_deviation | +( | +double | +n, | +
| + | + | double | +p | +
| + | ) | ++ |
finds the standard deviation of the binomial distribution
| [in] | n | |
| [in] | p |
| double binomial_variance | +( | +double | +n, | +
| + | + | double | +p | +
| + | ) | ++ |
| double binomial_x_successes | +( | +double | +n, | +
| + | + | double | +p, | +
| + | + | double | +x | +
| + | ) | ++ |
| int main | +( | +) | ++ |
main function
+| double nCr | +( | +double | +n, | +
| + | + | double | +r | +
| + | ) | ++ |
Computes n choose r
| [in] | n | |
| [in] | r |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Welcome to TheAlgorithms/C-Plus-Plus! Before submitting pull requests, please make sure that you have read the whole guidelines. If you have any doubts about this contribution guide, please open an issue and clearly state your concerns.
+We are very happy that you consider implementing algorithms and data structures for others! This repository is referred to and used by learners from around the globe. Being one of our contributors, you agree and confirm that:
New implementation New implementation are welcome!
+Improving comments and adding tests to existing algorithms are much appreciated.
+Issues Please avoid opening issues asking to be "assigned” to a particular algorithm. This merely creates unnecessary noise for maintainers. Instead, please submit your implementation in a pull request and it will be evaluated by project maintainers.
+"_" as separator"_" as separator ( no spaces or "-" allowed )Examples of commit messages with semantic prefixes:
Common prefixes:
To see if cpplint is already installed, do:
cpplint --version # currently returns "cpplint 1.4.4" If cpplint is ___not___ installed then do:python3 -m pip install cpplint # If that does not work then try...py -m pip install cpplint # If that does not work then try...pip install cpplint Once cpplint is installed, test your file(s) with:cpplint --filter=-legal my_file.cpp my_other_file.cpp # Fix any issues and try again.The clang-format tool can fix whitespace related cpplint issues.
brew install clang-format # Only needs to be installed once.clang-format -i -style="{IndentWidth: 4}" my_file.cppMost importantly,
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m) +More...
+#include <cassert>#include <cmath>#include <iostream>#include <cstring>+Namespaces | |
| string_search | |
| String search algorithms. | |
+Macros | |
| +#define | PRIME 5 |
| Prime modulus for hash functions. | |
+Functions | |
| int64_t | string_search::create_hash (const std::string &s, int n) |
| int64_t | string_search::recalculate_hash (const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength) |
| bool | string_search::check_if_equal (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2) |
| int | string_search::rabin_karp (const std::string &str, const std::string &pat) |
| int | main (void) |
The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m)
+| int main | +( | +void | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method +More...
+#include <cmath>#include <ctime>#include <fstream>#include <iostream>#include <valarray>+Functions | |
| void | problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Problem statement for a system with first-order differential equations. Updates the system differential variables. More... | |
| void | exact_solution (const double &x, std::valarray< double > *y) |
| Exact solution of the problem. Used for solution comparison. More... | |
| void | midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Compute next step approximation using the midpoint-Euler method. More... | |
| double | midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false) |
| Compute approximation using the midpoint-Euler method in the given limits. More... | |
| void | save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0) |
| int | main (int argc, char *argv[]) |
Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method
+ +The ODE being solved is:
+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*} +
+The exact solution for the above problem is:
+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*} +
+ The computation results are stored to a text file midpoint_euler.csv and the exact soltuion results in exact.csv for comparison.
To implement Van der Pol oscillator, change the problem function to:
| void exact_solution | +( | +const double & | +x, | +
| + | + | std::valarray< double > * | +y | +
| + | ) | ++ |
| int main | +( | +int | +argc, | +
| + | + | char * | +argv[] | +
| + | ) | ++ |
Main Function
+| void problem | +( | +const double & | +x, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | std::valarray< double > * | +dy | +
| + | ) | ++ |
Problem statement for a system with first-order differential equations. Updates the system differential variables.
+| [in] | x | independent variable(s) |
| [in,out] | y | dependent variable(s) |
| [in,out] | dy | first-derivative of dependent variable(s) |
| void save_exact_solution | +( | +const double & | +X0, | +
| + | + | const double & | +X_MAX, | +
| + | + | const double & | +step_size, | +
| + | + | const std::valarray< double > & | +Y0 | +
| + | ) | ++ |
Function to compute and save exact solution for comparison
+| [in] | X0 | initial value of independent variable |
| [in] | X_MAX | final value of independent variable |
| [in] | step_size | independent variable step size |
| [in] | Y0 | initial values of dependent variables |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for stack_linkedList, including all inherited members.
+| dequeue() (defined in stack_linkedList) | stack_linkedList | |
| display() (defined in stack_linkedList) | stack_linkedList | |
| enqueue(int) (defined in stack_linkedList) | stack_linkedList | |
| front (defined in stack_linkedList) | stack_linkedList | |
| rear (defined in stack_linkedList) | stack_linkedList | |
| stack_linkedList() (defined in stack_linkedList) | stack_linkedList | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Matrix Exponentiation. +More...
+#include <iostream>#include <vector>+Macros | |
| #define | ll int64_t |
| #define | endl std::endl |
| #define | pb push_back |
| +#define | MOD 1000000007 |
+Functions | |
| ll | ab (ll x) |
| vector< vector< ll > > | multiply (const vector< vector< ll >> &A, const vector< vector< ll >> &B) |
| vector< vector< ll > > | power (const vector< vector< ll >> &A, ll p) |
| ll | ans (ll n) |
| int | main () |
+Variables | |
| ll | k |
| vector< ll > | a |
| +vector< ll > | b |
| +vector< ll > | c |
Matrix Exponentiation.
+The problem can be solved with DP but constraints are high.
+ \(a_i = b_i\) (for \(i <= k\))
+ \(a_i = c_1 a_{i-1} + c_2 a_{i-2} + ... + c_k a_{i-k}\) (for \(i > k\))
+Taking the example of Fibonacci series, \(k=2\)
+ \(b_1 = 1,\; b_2=1\)
+ \(c_1 = 1,\; c_2=1\)
+ \(a = \begin{bmatrix}0& 1& 1& 2& \ldots\end{bmatrix}\)
+This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a general way to use it. The program takes the input of B and C matrix.
Steps for Matrix Expo
The first element of this matrix is the required result.
+| #define endl std::endl | +
shorthand definition for std::endl
| #define ll int64_t | +
shorthand definition for int64_t
| #define pb push_back | +
shorthand definition for int64_t
Wrapper for Fibonacci
| [in] | n | \(n^\text{th}\) Fibonacci number |
| int main | +( | +) | ++ |
Main function
+| vector<vector<ll> > multiply | +( | +const vector< vector< ll >> & | +A, | +
| + | + | const vector< vector< ll >> & | +B | +
| + | ) | ++ |
To multiply 2 matrices
| [in] | A | matrix 1 of size (m \(\times\)n) |
| [in] | B | matrix 2 of size (p \(\times\)q)+ |
| vector<vector<ll> > power | +( | +const vector< vector< ll >> & | +A, | +
| + | + | ll | +p | +
| + | ) | ++ |
computing integer power of a matrix using recursive multiplication.
| [in] | A | base matrix |
| [in] | p | exponent |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Solve the equation \(f(x)=0\) using bisection method +More...
+#include <cmath>#include <iostream>#include <limits>+Macros | |
| +#define | EPSILON 1e-6 |
| +#define | MAX_ITERATIONS 50000 |
| Maximum number of iterations to check. | |
+Functions | |
| static double | eq (double i) |
| template<typename T > | |
| int | sgn (T val) |
| int | main () |
Solve the equation \(f(x)=0\) using bisection method
+Given two points \(a\) and \(b\) such that \(f(a)<0\) and \(f(b)>0\), then the \((i+1)^\text{th}\) approximation is given by:
+\[ x_{i+1} = \frac{a_i+b_i}{2} \] +
+For the next iteration, the interval is selected as: \([a,x]\) if \(x>0\) or \([x,b]\) if \(x<0\). The Process is continued till a close enough approximation is achieved.
+
+
|
+ +static | +
define \(f(x)\) to find root for
+| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| + | Edge (Edge &&)=default |
| +Edge & | operator= (Edge &&)=default |
| + | Edge (Edge const &)=default |
| +Edge & | operator= (Edge const &)=default |
| Edge (unsigned int source, unsigned int destination) | |
+Public Attributes | |
| +int | src |
| +int | dst |
| +int | weight |
| +unsigned int | src |
| +unsigned int | dest |
Implementation of non-weighted directed edge of a graph.
+The source vertex of the edge is labelled "src" and destination vertex is labelled "dest".
+
+
|
+ +inline | +
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| void | new_val (T x) |
| double | mean () const |
| double | variance () const |
| double | std () const |
+Private Attributes | |
| +unsigned int | n = 0 |
| +double | Ex |
| +double | Ex2 |
| +T | K |
+Friends | |
| std::istream & | operator>> (std::istream &input, stats_computer1 &stat) |
continuous mean and variance computance using first value as an approximation for the mean. If the first number is much far form the mean, the algorithm becomes very inaccurate to compute variance and standard deviation.
+
+
|
+ +inline | +
+
|
+ +inline | +
+
|
+ +inline | +
+
|
+ +inline | +
+
|
+ +friend | +
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Prime Factorization is a very important and useful technique to factorize any number into its prime factors. It has various applications in the field of number theory.
+The method of prime factorization involves two function calls. First: Calculating all the prime number up till a certain range using the standard Sieve of Eratosthenes.
+Second: Using the prime numbers to reduce the the given number and thus find all its prime factors.
+The complexity of the solution involves approx. O(n logn) in calculating sieve of eratosthenes O(log n) in calculating the prime factors of the number. So in total approx. O(n logn).
+Requirements: For compile you need the compiler flag for C++ 11
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute double factorial: \(n!!\). +More...
+#include <cassert>#include <iostream>+Functions | |
| uint64_t | double_factorial_iterative (uint64_t n) |
| uint64_t | double_factorial_recursive (uint64_t n) |
| +int | main () |
| main function | |
Compute double factorial: \(n!!\).
+Double factorial of a non-negative integer n, is defined as the product of all the integers from 1 to n that have the same parity (odd or even) as n.
+It is also called as semifactorial of a number and is denoted by \(n!!\)
| uint64_t double_factorial_iterative | +( | +uint64_t | +n | ) | ++ |
| uint64_t double_factorial_recursive | +( | +uint64_t | +n | ) | ++ |
Compute double factorial using resursive method.
+Recursion can be costly for large numbers.
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| +int | BinarySearch (int *array, int first, int last, int x) |
| +int | LinarSearch (int *array, int x) |
| +int | Search (int x) |
| +void | Sort () |
| +void | insert (int x) |
| +void | Remove (int x) |
| +void | Show () |
+Public Attributes | |
| +int | data [50] |
| +int | top = 0 |
| +bool | isSorted = false |
| +int | key |
| key value for node | |
| +struct list * | next |
| pointer to next link in the chain | |
a one-way linked list
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Bubble sort algorithm. +More...
+#include <iostream>#include <vector>+Functions | |
| +int | main () |
Bubble sort algorithm.
+The working principle of the Bubble sort algorithm:
+Bubble sort algorithm is the bubble sorting algorithm. The most important reason for calling the bubble is that the largest number is thrown at the end of this algorithm. This is all about the logic. In each iteration, the largest number is expired and when iterations are completed, the sorting takes place.
+What is Swap?
+Swap in the software means that two variables are displaced. An additional variable is required for this operation. x = 5, y = 10. We want x = 10, y = 5. Here we create the most variable to do it.
+int z; z = x; x = y; y = z;
+The above process is a typical displacement process. When x assigns the value to x, the old value of x is lost. That's why we created a variable z to create the first value of the value of x, and finally, we have assigned to y.
+Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)
+Bubble Sort Worst Case Performance is O (n²). Why is that? Because if you remember Big O Notation, we were calculating the complexity of the algorithms in the nested loops. The n * (n - 1) product gives us O (n²) performance. In the worst case all the steps of the cycle will occur. Bubble Sort (Avarage Case) Performance. Bubble Sort is not an optimal algorithm. in average, O (n²) performance is taken. Bubble Sort Best Case Performance. O (n). However, you can't get the best status in the code we shared above. This happens on the optimized bubble sort algorithm. It's right down there.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
C++ Program to find the modular inverse using Fermat's Little Theorem +More...
+#include <iostream>#include <vector>+Functions | |
| int64_t | binExpo (int64_t a, int64_t b, int64_t m) |
| bool | isPrime (int64_t m) |
| int | main () |
C++ Program to find the modular inverse using Fermat's Little Theorem
+Fermat's Little Theorem state that
+\[ϕ(m) = m-1\] +
+where \(m\) is a prime number.
+\begin{eqnarray*} a \cdot x &≡& 1 \;\text{mod}\; m\\ x &≡& a^{-1} \;\text{mod}\; m \end{eqnarray*} +
+Using Euler's theorem we can modify the equation.
+\[ a^{ϕ(m)} ≡ 1 \;\text{mod}\; m \] +
+(Where '^' denotes the exponent operator)
+Here 'ϕ' is Euler's Totient Function. For modular inverse existence 'a' and 'm' must be relatively primes numbers. To apply Fermat's Little Theorem is necessary that 'm' must be a prime number. Generally in many competitive programming competitions 'm' is either 1000000007 (1e9+7) or 998244353.
+We considered m as large prime (1e9+7). \(a^{ϕ(m)} ≡ 1 \;\text{mod}\; m\) (Using Euler's Theorem) \(ϕ(m) = m-1\) using Fermat's Little Theorem. \(a^{m-1} ≡ 1 \;\text{mod}\; m\) Now multiplying both side by \(a^{-1}\).
+\begin{eqnarray*} a^{m-1} \cdot a^{-1} &≡& a^{-1} \;\text{mod}\; m\\ a^{m-2} &≡& a^{-1} \;\text{mod}\; m \end{eqnarray*} +
+We will find the exponent using binary exponentiation. Such that the algorithm works in \(O(\log m)\) time.
+Examples: -
| int64_t binExpo | +( | +int64_t | +a, | +
| + | + | int64_t | +b, | +
| + | + | int64_t | +m | +
| + | ) | ++ |
Recursive function to calculate exponent in \(O(\log n)\) using binary exponent.
+ +| bool isPrime | +( | +int64_t | +m | ) | ++ |
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for CycleCheck, including all inherited members.
+| in_stack enum value (defined in CycleCheck) | CycleCheck | private |
| isCyclicBFS(Graph const &graph) | CycleCheck | inlinestatic |
| isCyclicDFS(Graph const &graph) | CycleCheck | inlinestatic |
| isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node) | CycleCheck | inlineprivatestatic |
| nodeStates enum name (defined in CycleCheck) | CycleCheck | private |
| not_visited enum value (defined in CycleCheck) | CycleCheck | private |
| visited enum value (defined in CycleCheck) | CycleCheck | private |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
check whether two line segments intersect each other or not. +More...
+#include <algorithm>#include <iostream>+Classes | |
| struct | Point |
| struct | SegmentIntersection |
+Functions | |
| int | main () |
check whether two line segments intersect each other or not.
+| int main | +( | +) | ++ |
This is the main function to test whether the algorithm is working well.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Machine learning algorithms. +More...
++Classes | |
| class | adaline |
+Functions | |
| int | save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double >>> &W) |
| double | update_weights (const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R) |
| void | kohonen_som (const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min) |
| void | update_weights (const std::valarray< double > &x, std::vector< std::valarray< double >> *W, std::valarray< double > *D, double alpha, int R) |
| void | kohonen_som_tracer (const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min) |
Machine learning algorithms.
+| void machine_learning::kohonen_som | +( | +const std::vector< std::valarray< double >> & | +X, | +
| + | + | std::vector< std::vector< std::valarray< double >>> * | +W, | +
| + | + | double | +alpha_min | +
| + | ) | ++ |
Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given datset.
+| [in] | X | data set |
| [in,out] | W | weights matrix |
| [in] | alpha_min | terminal value of alpha |
| void machine_learning::kohonen_som_tracer | +( | +const std::vector< std::valarray< double >> & | +X, | +
| + | + | std::vector< std::valarray< double >> * | +W, | +
| + | + | double | +alpha_min | +
| + | ) | ++ |
Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given datset.
+| [in] | X | data set |
| [in,out] | W | weights matrix |
| [in] | alpha_min | terminal value of alpha |
| int machine_learning::save_u_matrix | +( | +const char * | +fname, | +
| + | + | const std::vector< std::vector< std::valarray< double >>> & | +W | +
| + | ) | ++ |
Create the distance matrix or U-matrix from the trained 3D weiths matrix and save to disk.
+| [in] | fname | filename to save in (gets overwriten without confirmation) |
| [in] | W | model matrix to save |
| void machine_learning::update_weights | +( | +const std::valarray< double > & | +x, | +
| + | + | std::vector< std::valarray< double >> * | +W, | +
| + | + | std::valarray< double > * | +D, | +
| + | + | double | +alpha, | +
| + | + | int | +R | +
| + | ) | ++ |
Update weights of the SOM using Kohonen algorithm
+| [in] | X | data point |
| [in,out] | W | weights matrix |
| [in,out] | D | temporary vector to store distances |
| [in] | alpha | learning rate \(0<\alpha\le1\) |
| [in] | R | neighborhood range |
| double machine_learning::update_weights | +( | +const std::valarray< double > & | +X, | +
| + | + | std::vector< std::vector< std::valarray< double >>> * | +W, | +
| + | + | std::vector< std::valarray< double >> * | +D, | +
| + | + | double | +alpha, | +
| + | + | int | +R | +
| + | ) | ++ |
Update weights of the SOM using Kohonen algorithm
+| [in] | X | data point - N features |
| [in,out] | W | weights matrix - PxQxN |
| [in,out] | D | temporary vector to store distances PxQ |
| [in] | alpha | learning rate \(0<\alpha\le1\) |
| [in] | R | neighborhood range |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Exponential search algorithm +More...
+#include <cassert>#include <cmath>#include <iostream>#include <cstring>+Functions | |
| template<class Type > | |
| Type * | binary_s (Type *array, size_t size, Type key) |
| template<class Type > | |
| Type * | struzik_search (Type *array, size_t size, Type key) |
| int | main () |
The algorithm try to search the range where the key should be. If it has been found we do a binary search there. The range of the search grows by exponential every time. If the key is larger than the last element of array, the start of block(block_front) will be equal to the end of block(block_size) and the algorithm return null ponter, every other cases the algoritm return fom the loop.
+
+
|
+ +inline | +
Binary Search Algorithm (used by struzik_search)
+
nullptr if value not found | int main | +( | +) | ++ |
Main function
+| Type* struzik_search | +( | +Type * | +array, | +
| + | + | size_t | +size, | +
| + | + | Type | +key | +
| + | ) | ++ |
Struzik Search Algorithm(Exponential)
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for graph, including all inherited members.
+| addedge(int src, int dest) (defined in graph) | graph | |
| addEdge(int, int) (defined in graph) | graph | |
| adj (defined in graph) | graph | private |
| adj (defined in graph) | graph | private |
| bfs(int s) (defined in graph) | graph | |
| connected_components (defined in graph) | graph | private |
| depth_first_search() (defined in graph) | graph | private |
| explore(int, vector< bool > &) (defined in graph) | graph | private |
| getConnectedComponents() (defined in graph) | graph | inline |
| graph(int v) (defined in graph) | graph | |
| graph(int n) (defined in graph) | graph | inlineexplicit |
| printgraph() (defined in graph) | graph | |
| v (defined in graph) | graph | private |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| void | new_val (T x) |
| double | mean () const |
| double | variance () const |
| double | std () const |
+Private Attributes | |
| +unsigned int | n = 0 |
| +double | mu = 0 |
| +double | var = 0 |
| +double | M = 0 |
+Friends | |
| std::istream & | operator>> (std::istream &input, stats_computer2 &stat) |
continuous mean and variance computance using Welford's algorithm (very accurate)
+
+
|
+ +inline | +
+
|
+ +inline | +
+
|
+ +inline | +
+
|
+ +inline | +
+
|
+ +friend | +
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| Point (double a=0.f, double b=0.f) | |
+Public Attributes | |
| +int | x |
| +int | y |
| Point respect to x coordinate. | |
| double | x |
| double | y |
Define a Point.
+Define a point
+| double Point::x | +
abscissa
+ +| double Point::y | +
ordinate
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
STL namespace. +More...
++Classes | |
| class | add_const |
| class | add_cv |
| class | add_lvalue_reference |
| class | add_pointer |
| class | add_rvalue_reference |
| class | add_volatile |
| class | adopt_lock_t |
| class | aligned_storage |
| class | aligned_union |
| class | alignment_of |
| class | allocator |
| STL class. | |
| class | allocator_arg_t |
| class | allocator_traits |
| class | array |
| STL class. | |
| class | atomic |
| STL class. | |
| class | atomic_flag |
| class | atomic_ref |
| STL class. | |
| class | auto_ptr |
| STL class. | |
| class | back_insert_iterator |
| class | bad_alloc |
| STL class. | |
| class | bad_array_length |
| class | bad_array_new_length |
| class | bad_cast |
| STL class. | |
| class | bad_exception |
| STL class. | |
| class | bad_function_call |
| class | bad_optional_access |
| class | bad_typeid |
| STL class. | |
| class | bad_weak_ptr |
| class | basic_filebuf |
| class | basic_fstream |
| STL class. | |
| class | basic_ifstream |
| STL class. | |
| class | basic_ios |
| STL class. | |
| class | basic_iostream |
| STL class. | |
| class | basic_istream |
| STL class. | |
| class | basic_istringstream |
| STL class. | |
| class | basic_ofstream |
| STL class. | |
| class | basic_ostream |
| STL class. | |
| class | basic_ostringstream |
| STL class. | |
| class | basic_regex |
| class | basic_streambuf |
| class | basic_string |
| STL class. | |
| class | basic_string_view |
| STL class. | |
| class | basic_stringbuf |
| class | basic_stringstream |
| STL class. | |
| class | bernoulli_distribution |
| class | bidirectional_iterator_tag |
| class | binary_function |
| class | binary_negate |
| class | binomial_distribution |
| class | bit_and |
| class | bit_not |
| class | bit_or |
| class | bitset |
| STL class. | |
| class | cauchy_distribution |
| class | centi |
| class | cerr |
| class | char_traits |
| class | chi_squared_distribution |
| class | cin |
| class | clock_t |
| class | clog |
| class | cmatch |
| class | codecvt |
| class | codecvt_base |
| class | codecvt_byname |
| class | codecvt_utf16 |
| class | codecvt_utf8 |
| class | codecvt_utf8_utf16 |
| class | collate |
| class | collate_byname |
| class | common_type |
| class | complex |
| STL class. | |
| class | condition_variable |
| class | condition_variable_any |
| class | conditional |
| class | cout |
| class | cregex_iterator |
| class | cregex_token_iterator |
| class | csub_match |
| class | ctype |
| class | ctype_base |
| class | ctype_byname |
| class | deca |
| class | decay |
| class | deci |
| class | default_delete |
| class | default_random_engine |
| class | defer_lock_t |
| class | deque |
| STL class. | |
| class | discard_block_engine |
| class | discrete_distribution |
| class | divides |
| class | domain_error |
| STL class. | |
| class | dynarray |
| class | enable_if |
| class | enable_shared_from_this |
| class | equal_to |
| class | errc |
| class | error_category |
| STL class. | |
| class | error_code |
| STL class. | |
| class | error_condition |
| STL class. | |
| class | exa |
| class | exception |
| STL class. | |
| class | exception_ptr |
| class | exponential_distribution |
| class | extent |
| class | extreme_value_distribution |
| class | false_type |
| class | femto |
| class | FILE |
| class | filebuf |
| class | fisher_f_distribution |
| class | forward_iterator_tag |
| class | forward_list |
| STL class. | |
| class | fpos |
| class | fpos_t |
| class | front_insert_iterator |
| class | fstream |
| STL class. | |
| class | function |
| class | future |
| class | future_error |
| class | gamma_distribution |
| class | geometric_distribution |
| class | giga |
| class | greater |
| class | greater_equal |
| class | has_virtual_destructor |
| class | hash |
| class | hecto |
| class | ifstream |
| STL class. | |
| class | independent_bits_engine |
| class | initializer_list |
| class | input_iterator_tag |
| class | insert_iterator |
| class | int16_t |
| class | int32_t |
| class | int64_t |
| class | int8_t |
| class | int_fast16_t |
| class | int_fast32_t |
| class | int_fast64_t |
| class | int_fast8_t |
| class | int_least16_t |
| class | int_least32_t |
| class | int_least64_t |
| class | int_least8_t |
| class | integer_sequence |
| class | integral_constant |
| class | intmax_t |
| class | intptr_t |
| class | invalid_argument |
| STL class. | |
| class | ios |
| STL class. | |
| class | ios_base |
| STL class. | |
| class | iostream |
| class | is_abstract |
| class | is_arithmetic |
| class | is_array |
| class | is_assignable |
| class | is_base_of |
| class | is_bind_expression |
| class | is_class |
| class | is_compound |
| class | is_const |
| class | is_constructible |
| class | is_convertible |
| class | is_copy_assignable |
| class | is_copy_constructible |
| class | is_default_constructible |
| class | is_destructible |
| class | is_empty |
| class | is_enum |
| class | is_error_code_enum |
| class | is_error_condition_enum |
| class | is_floating_point |
| class | is_function |
| class | is_fundamental |
| class | is_integral |
| class | is_literal_type |
| class | is_lvalue_reference |
| class | is_member_function_pointer |
| class | is_member_object_pointer |
| class | is_member_pointer |
| class | is_move_assignable |
| class | is_move_constructible |
| class | is_nothrow_assignable |
| class | is_nothrow_constructible |
| class | is_nothrow_copy_assignable |
| class | is_nothrow_copy_constructible |
| class | is_nothrow_default_constructible |
| class | is_nothrow_destructible |
| class | is_nothrow_move_assignable |
| class | is_nothrow_move_constructible |
| class | is_object |
| class | is_placeholder |
| class | is_pod |
| class | is_pointer |
| class | is_polymorphic |
| class | is_reference |
| class | is_rvalue_reference |
| class | is_same |
| class | is_scalar |
| class | is_signed |
| class | is_standard_layout |
| class | is_trivial |
| class | is_trivially_assignable |
| class | is_trivially_constructible |
| class | is_trivially_copy_assignable |
| class | is_trivially_copy_constructible |
| class | is_trivially_copyable |
| class | is_trivially_default_constructible |
| class | is_trivially_destructible |
| class | is_trivially_move_assignable |
| class | is_trivially_move_constructible |
| class | is_union |
| class | is_unsigned |
| class | is_void |
| class | is_volatile |
| class | istream |
| STL class. | |
| class | istream_iterator |
| class | istreambuf_iterator |
| class | istringstream |
| STL class. | |
| class | istrstream |
| class | iterator |
| class | iterator_traits |
| class | jmp_buf |
| class | jthread |
| STL class. | |
| class | kilo |
| class | knuth_b |
| class | lconv |
| class | length_error |
| STL class. | |
| class | less |
| class | less_equal |
| class | linear_congruential_engine |
| class | list |
| STL class. | |
| class | locale |
| class | lock_guard |
| STL class. | |
| class | logic_error |
| STL class. | |
| class | logical_and |
| class | logical_not |
| class | logical_or |
| class | lognormal_distribution |
| class | make_signed |
| class | make_unsigned |
| class | map |
| STL class. | |
| class | match_results |
| class | max_align_t |
| class | mbstate_t |
| class | mega |
| class | mersenne_twister_engine |
| class | messages |
| class | messages_base |
| class | messages_byname |
| class | micro |
| class | milli |
| class | minstd_rand |
| class | minstd_rand0 |
| class | minus |
| class | modulus |
| class | money_base |
| class | money_get |
| class | money_put |
| class | moneypunct |
| class | moneypunct_byname |
| class | move_iterator |
| class | mt19937 |
| class | mt19937_64 |
| class | multimap |
| STL class. | |
| class | multiplies |
| class | multiset |
| STL class. | |
| class | mutex |
| STL class. | |
| class | nano |
| class | negate |
| class | negative_binomial_distribution |
| class | nested_exception |
| class | new_handler |
| class | normal_distribution |
| class | not_equal_to |
| class | nothrow_t |
| class | nullptr_t |
| class | num_get |
| class | num_put |
| class | numeric_limits |
| class | numpunct |
| class | numpunct_byname |
| class | ofstream |
| STL class. | |
| class | once_flag |
| class | ostream |
| STL class. | |
| class | ostream_iterator |
| class | ostreambuf_iterator |
| class | ostringstream |
| STL class. | |
| class | ostrstream |
| class | out_of_range |
| STL class. | |
| class | output_iterator_tag |
| class | overflow_error |
| STL class. | |
| class | owner_less |
| class | packaged_task |
| class | pair |
| class | peta |
| class | pico |
| class | piecewise_constant_distribution |
| class | piecewise_construct_t |
| class | piecewise_linear_distribution |
| class | placeholders |
| class | plus |
| class | pointer_safety |
| class | pointer_traits |
| class | poisson_distribution |
| class | priority_queue |
| STL class. | |
| class | promise |
| class | ptrdiff_t |
| class | queue |
| STL class. | |
| class | random_access_iterator_tag |
| class | random_device |
| class | range_error |
| STL class. | |
| class | rank |
| class | ranlux24 |
| class | ranlux24_base |
| class | ranlux48 |
| class | ranlux48_base |
| class | ratio |
| class | ratio_add |
| class | ratio_divide |
| class | ratio_equal |
| class | ratio_greater |
| class | ratio_greater_equal |
| class | ratio_less |
| class | ratio_less_equal |
| class | ratio_multiply |
| class | ratio_not_equal |
| class | ratio_subtract |
| class | raw_storage_iterator |
| class | recursive_mutex |
| STL class. | |
| class | recursive_timed_mutex |
| STL class. | |
| class | reference_wrapper |
| class | regex |
| class | regex_error |
| class | regex_iterator |
| class | regex_token_iterator |
| class | regex_traits |
| class | remove_all_extents |
| class | remove_const |
| class | remove_cv |
| class | remove_extent |
| class | remove_pointer |
| class | remove_reference |
| class | remove_volatile |
| class | result_of |
| class | reverse_iterator |
| class | runtime_error |
| STL class. | |
| class | scoped_allocator_adaptor |
| class | seed_seq |
| class | set |
| STL class. | |
| class | shared_future |
| class | shared_lock |
| STL class. | |
| class | shared_mutex |
| STL class. | |
| class | shared_ptr |
| STL class. | |
| class | shared_timed_mutex |
| STL class. | |
| class | shuffle_order_engine |
| class | sig_atomic_t |
| class | size_t |
| class | smart_ptr |
| STL class. | |
| class | smatch |
| class | span |
| STL class. | |
| class | sregex_iterator |
| class | sregex_token_iterator |
| class | ssub_match |
| class | stack |
| STL class. | |
| class | streambuf |
| class | streamoff |
| class | streampos |
| class | streamsize |
| class | string |
| STL class. | |
| class | string_view |
| STL class. | |
| class | stringbuf |
| class | stringstream |
| STL class. | |
| class | strstream |
| class | strstreambuf |
| class | student_t_distribution |
| class | sub_match |
| class | subtract_with_carry_engine |
| class | system_error |
| STL class. | |
| class | tera |
| class | terminate_handler |
| class | thread |
| STL class. | |
| class | time_base |
| class | time_get |
| class | time_get_byname |
| class | time_put |
| class | time_put_byname |
| class | time_t |
| class | timed_mutex |
| STL class. | |
| class | tm |
| class | true_type |
| class | try_to_lock_t |
| class | tuple |
| class | type_index |
| class | type_info |
| class | u16streampos |
| class | u16string |
| STL class. | |
| class | u16string_view |
| STL class. | |
| class | u32streampos |
| class | u32string |
| STL class. | |
| class | u32string_view |
| STL class. | |
| class | u8string |
| STL class. | |
| class | u8string_view |
| STL class. | |
| class | uint16_t |
| class | uint32_t |
| class | uint64_t |
| class | uint8_t |
| class | uint_fast16_t |
| class | uint_fast32_t |
| class | uint_fast64_t |
| class | uint_fast8_t |
| class | uint_least16_t |
| class | uint_least32_t |
| class | uint_least64_t |
| class | uint_least8_t |
| class | uintmax_t |
| class | uintptr_t |
| class | unary_function |
| class | unary_negate |
| class | underflow_error |
| STL class. | |
| class | underlying_type |
| class | unexpected_handler |
| class | uniform_int_distribution |
| class | uniform_real_distribution |
| class | unique_lock |
| STL class. | |
| class | unique_ptr |
| STL class. | |
| class | unordered_map |
| STL class. | |
| class | unordered_multimap |
| STL class. | |
| class | unordered_multiset |
| STL class. | |
| class | unordered_set |
| STL class. | |
| class | uses_allocator |
| class | valarray |
| STL class. | |
| class | vector |
| STL class. | |
| class | wbuffer_convert |
| class | wcerr |
| class | wcin |
| class | wclog |
| class | wcmatch |
| class | wcout |
| class | wcregex_iterator |
| class | wcregex_token_iterator |
| class | wcsub_match |
| class | weak_ptr |
| STL class. | |
| class | weibull_distribution |
| class | wfilebuf |
| class | wfstream |
| STL class. | |
| class | wifstream |
| STL class. | |
| class | wios |
| STL class. | |
| class | wiostream |
| class | wistream |
| STL class. | |
| class | wistringstream |
| STL class. | |
| class | wofstream |
| STL class. | |
| class | wostream |
| STL class. | |
| class | wostringstream |
| STL class. | |
| class | wregex |
| class | wsmatch |
| class | wsregex_iterator |
| class | wsregex_token_iterator |
| class | wssub_match |
| class | wstreambuf |
| class | wstreampos |
| class | wstring |
| STL class. | |
| class | wstring_convert |
| class | wstring_view |
| STL class. | |
| class | wstringbuf |
| class | wstringstream |
| STL class. | |
| class | yocto |
| class | yotta |
| class | zetta |
+Functions | |
| +T | atomic_fetch_and_explicit (T... args) |
| +T | atomic_fetch_xor_explicit (T... args) |
| +T | set_unexpected (T... args) |
| +T | fputs (T... args) |
| +T | modf (T... args) |
| +T | not2 (T... args) |
| +T | strlen (T... args) |
| +T | exp2 (T... args) |
| +T | setiosflags (T... args) |
| +T | adjacent_difference (T... args) |
| +T | cos (T... args) |
| +T | fwscanf (T... args) |
| +T | atomic_init (T... args) |
| +T | forward_as_tuple (T... args) |
| +T | abort (T... args) |
| +T | wcsncmp (T... args) |
| +T | set_intersection (T... args) |
| +T | atomic_signal_fence (T... args) |
| +T | llabs (T... args) |
| +T | make_move_iterator (T... args) |
| +T | scanf (T... args) |
| +T | nextafter (T... args) |
| +T | stol (T... args) |
| +T | strcspn (T... args) |
| +T | ungetwc (T... args) |
| +T | transform (T... args) |
| +T | putc (T... args) |
| +T | iswdigit (T... args) |
| +T | rint (T... args) |
| +T | memset (T... args) |
| +T | isgraph (T... args) |
| +T | replace_copy_if (T... args) |
| +T | scalbn (T... args) |
| +T | partial_sort_copy (T... args) |
| +T | make_exception_ptr (T... args) |
| +T | frexp (T... args) |
| +T | isxdigit (T... args) |
| +T | atomic_exchange_explicit (T... args) |
| +T | wprintf (T... args) |
| +T | fdim (T... args) |
| +T | wctype (T... args) |
| +T | mbrtoc32 (T... args) |
| +T | setw (T... args) |
| +T | get_temporary_buffer (T... args) |
| +T | fmax (T... args) |
| +T | atomic_thread_fence (T... args) |
| +T | atomic_exchange (T... args) |
| +T | fgetwc (T... args) |
| +T | swprintf (T... args) |
| +T | prev_permutation (T... args) |
| +T | max_element (T... args) |
| +T | set_symmetric_difference (T... args) |
| +T | wcscpy (T... args) |
| +T | const_pointer_cast (T... args) |
| +T | minmax_element (T... args) |
| +T | wcstok (T... args) |
| +T | ref (T... args) |
| +T | feupdateenv (T... args) |
| +T | endl (T... args) |
| +T | end (T... args) |
| +T | wmemmove (T... args) |
| +T | fmin (T... args) |
| +T | uninitialized_fill_n (T... args) |
| +T | nouppercase (T... args) |
| +T | noshowpos (T... args) |
| +T | ctime (T... args) |
| +T | wmemset (T... args) |
| +T | iswpunct (T... args) |
| +T | pop_heap (T... args) |
| +T | sprintf (T... args) |
| +T | fixed (T... args) |
| +T | make_shared (T... args) |
| +T | make_heap (T... args) |
| +T | fmod (T... args) |
| +T | atol (T... args) |
| +T | uninitialized_copy (T... args) |
| +T | dynamic_pointer_cast (T... args) |
| +T | set_union (T... args) |
| +T | hexfloat (T... args) |
| +T | vswprintf (T... args) |
| +T | asctime (T... args) |
| +T | iswspace (T... args) |
| +T | nan (T... args) |
| +T | sort (T... args) |
| +T | quick_exit (T... args) |
| +T | log10 (T... args) |
| +T | mbstowcs (T... args) |
| +T | isspace (T... args) |
| +T | strncat (T... args) |
| +T | isinf (T... args) |
| +T | atof (T... args) |
| +T | erf (T... args) |
| +T | is_sorted_until (T... args) |
| +T | cbrt (T... args) |
| +T | log1p (T... args) |
| +T | return_temporary_buffer (T... args) |
| +T | mbsrtowcs (T... args) |
| +T | feraiseexcept (T... args) |
| +T | fseek (T... args) |
| +T | atomic_fetch_or_explicit (T... args) |
| +T | log (T... args) |
| +T | putchar (T... args) |
| +T | make_tuple (T... args) |
| +T | expm1 (T... args) |
| +T | fma (T... args) |
| +T | remove_copy_if (T... args) |
| +T | showpoint (T... args) |
| +T | fscanf (T... args) |
| +T | stable_partition (T... args) |
| +T | fill_n (T... args) |
| +T | remove_copy (T... args) |
| +T | atomic_compare_exchange_strong_explicit (T... args) |
| +T | wctomb (T... args) |
| +T | fgets (T... args) |
| +T | remainder (T... args) |
| +T | allocate_shared (T... args) |
| +T | unique (T... args) |
| +T | includes (T... args) |
| +T | iswalnum (T... args) |
| +T | exit (T... args) |
| +T | put_time (T... args) |
| +T | to_string (T... args) |
| +T | is_heap_until (T... args) |
| +T | wcstold (T... args) |
| +T | stold (T... args) |
| +T | ftell (T... args) |
| +T | copy_backward (T... args) |
| +T | wcstoll (T... args) |
| +T | perror (T... args) |
| +T | vwscanf (T... args) |
| +T | stable_sort (T... args) |
| +T | generic_category (T... args) |
| +T | abs(int) (T... args) |
| +T | fgetws (T... args) |
| +T | showpos (T... args) |
| +T | exp (T... args) |
| +T | fill (T... args) |
| +T | isalpha (T... args) |
| +T | lgamma (T... args) |
| +T | feclearexcept (T... args) |
| +T | wcsncpy (T... args) |
| +T | undeclare_reachable (T... args) |
| +T | oct (T... args) |
| +T | strspn (T... args) |
| +T | realloc (T... args) |
| +T | copy (T... args) |
| +T | binary_search (T... args) |
| +T | system_category (T... args) |
| +T | mbrtowc (T... args) |
| +T | strtof (T... args) |
| +T | mem_fn (T... args) |
| +T | distance (T... args) |
| +T | lock (T... args) |
| +T | strcmp (T... args) |
| +T | tmpfile (T... args) |
| +T | hypot (T... args) |
| +T | getenv (T... args) |
| +T | strrchr (T... args) |
| +T | count (T... args) |
| +T | tan (T... args) |
| +T | strftime (T... args) |
| +T | stod (T... args) |
| +T | towupper (T... args) |
| +T | atoll (T... args) |
| +T | atomic_store (T... args) |
| +T | stoi (T... args) |
| +T | rethrow_exception (T... args) |
| +T | sin (T... args) |
| +T | atomic_fetch_sub_explicit (T... args) |
| +T | unexpected (T... args) |
| +T | mbtowc (T... args) |
| +T | get_time (T... args) |
| +T | partition (T... args) |
| +T | next (T... args) |
| +T | isfinite (T... args) |
| +T | boolalpha (T... args) |
| +T | fetestexcept (T... args) |
| +T | mbrlen (T... args) |
| +T | iswgraph (T... args) |
| +T | time (T... args) |
| +T | atomic_compare_exchange_strong (T... args) |
| +T | wcschr (T... args) |
| +T | uppercase (T... args) |
| +T | lower_bound (T... args) |
| +T | copy_if (T... args) |
| +T | isnan (T... args) |
| +T | has_facet (T... args) |
| +T | kill_dependency (T... args) |
| +T | uninitialized_copy_n (T... args) |
| +T | feholdexcept (T... args) |
| +T | div (T... args) |
| +T | at_quick_exit (T... args) |
| +T | wcspbrk (T... args) |
| +T | search (T... args) |
| +T | find_first_of (T... args) |
| +T | iota (T... args) |
| +T | declare_reachable (T... args) |
| +T | atomic_compare_exchange_weak (T... args) |
| +T | strtod (T... args) |
| +T | accumulate (T... args) |
| +T | wcsrchr (T... args) |
| +T | min_element (T... args) |
| +T | clearerr (T... args) |
| +T | random_shuffle (T... args) |
| +T | iswalpha (T... args) |
| +T | atomic_fetch_and (T... args) |
| +T | wmemchr (T... args) |
| +T | bsearch (T... args) |
| +T | ilogb (T... args) |
| +T | unique_copy (T... args) |
| +T | _Exit (T... args) |
| +T | move (T... args) |
| +T | find_end (T... args) |
| +T | fesetexceptflag (T... args) |
| +T | nth_element (T... args) |
| +T | gets (T... args) |
| +T | lexicographical_compare (T... args) |
| +T | nearbyint (T... args) |
| +T | memcpy (T... args) |
| +T | fwrite (T... args) |
| +T | unitbuf (T... args) |
| +T | iswlower (T... args) |
| +T | mblen (T... args) |
| +T | swscanf (T... args) |
| +T | wcstoimax (T... args) |
| +T | fprintf (T... args) |
| +T | find_if (T... args) |
| +T | strtoimax (T... args) |
| +T | isalnum (T... args) |
| +T | atomic_fetch_add_explicit (T... args) |
| +T | push_heap (T... args) |
| +T | min (T... args) |
| +T | fwprintf (T... args) |
| +T | uncaught_exception (T... args) |
| +T | strtoll (T... args) |
| +T | throw_with_nested (T... args) |
| +T | shuffle (T... args) |
| +T | isprint (T... args) |
| +T | get_new_handler (T... args) |
| +T | call_once (T... args) |
| +T | trunc (T... args) |
| +T | wcscspn (T... args) |
| +T | mbrtoc16 (T... args) |
| +T | lround (T... args) |
| +T | pow (T... args) |
| +T | tgamma (T... args) |
| +T | erfc (T... args) |
| +T | llround (T... args) |
| +T | abs(float) (T... args) |
| +T | asinh (T... args) |
| +T | feof (T... args) |
| +T | noskipws (T... args) |
| +T | find (T... args) |
| +T | atoi (T... args) |
| +T | not1 (T... args) |
| +T | vfscanf (T... args) |
| +T | stof (T... args) |
| +T | regex_search (T... args) |
| +T | rotate_copy (T... args) |
| +T | set_new_handler (T... args) |
| +T | undeclare_no_pointers (T... args) |
| +T | async (T... args) |
| +T | partition_point (T... args) |
| +T | vsscanf (T... args) |
| +T | fesetround (T... args) |
| +T | atomic_is_lock_free (T... args) |
| +T | tanh (T... args) |
| +T | ldiv (T... args) |
| +T | setbase (T... args) |
| +T | remove (T... args) |
| +T | strtol (T... args) |
| +T | strpbrk (T... args) |
| +T | signbit (T... args) |
| +T | wcsncat (T... args) |
| +T | get_money (T... args) |
| +T | set_difference (T... args) |
| +T | cref (T... args) |
| +T | getline (T... args) |
| +T | to_wstring (T... args) |
| +T | system (T... args) |
| +T | static_pointer_cast (T... args) |
| +T | wcstoumax (T... args) |
| +T | memmove (T... args) |
| +T | getwchar (T... args) |
| +T | scientific (T... args) |
| +T | wcsftime (T... args) |
| +T | begin (T... args) |
| +T | ceil (T... args) |
| +T | sinh (T... args) |
| +T | is_permutation (T... args) |
| +T | generate_n (T... args) |
| +T | acosh (T... args) |
| +T | advance (T... args) |
| +T | flush (T... args) |
| +T | atomic_fetch_xor (T... args) |
| +T | ws (T... args) |
| +T | signal (T... args) |
| +T | noshowbase (T... args) |
| +T | generate (T... args) |
| +T | ldexp (T... args) |
| +T | vsnprintf (T... args) |
| +T | remove_if (T... args) |
| +T | stoull (T... args) |
| +T | fegetexceptflag (T... args) |
| +T | find_if_not (T... args) |
| +T | merge (T... args) |
| +T | free (T... args) |
| +T | count_if (T... args) |
| +T | clock (T... args) |
| +T | mktime (T... args) |
| +T | inserter (T... args) |
| +T | puts (T... args) |
| +T | asin (T... args) |
| +T | iscntrl (T... args) |
| +T | difftime (T... args) |
| +T | terminate (T... args) |
| +T | memcmp (T... args) |
| +T | uninitialized_fill (T... args) |
| +T | hex (T... args) |
| +T | tie (T... args) |
| +T | back_inserter (T... args) |
| +T | upper_bound (T... args) |
| +T | adjacent_find (T... args) |
| +T | use_facet (T... args) |
| +T | vfwprintf (T... args) |
| +T | atomic_fetch_add (T... args) |
| +T | fsetpos (T... args) |
| +T | malloc (T... args) |
| +T | localtime (T... args) |
| +T | wcscmp (T... args) |
| +T | c32rtomb (T... args) |
| +T | isupper (T... args) |
| +T | wcstod (T... args) |
| +T | tolower (T... args) |
| +T | sort_heap (T... args) |
| +T | isdigit (T... args) |
| +T | wcslen (T... args) |
| +T | wmemcmp (T... args) |
| +T | move_if_noexcept (T... args) |
| +T | declval (T... args) |
| +T | fpclassify (T... args) |
| +T | iswupper (T... args) |
| +T | rand (T... args) |
| +T | atomic_compare_exchange_weak_explicit (T... args) |
| +T | partial_sort (T... args) |
| +T | llrint (T... args) |
| +T | fclose (T... args) |
| +T | reverse (T... args) |
| +T | partial_sum (T... args) |
| +T | showbase (T... args) |
| +T | vswscanf (T... args) |
| +T | atan (T... args) |
| +T | atanh (T... args) |
| +T | iter_swap (T... args) |
| +T | scalbln (T... args) |
| +T | reverse_copy (T... args) |
| +T | forward (T... args) |
| +T | getc (T... args) |
| +T | equal_range (T... args) |
| +T | atomic_fetch_sub (T... args) |
| +T | is_partitioned (T... args) |
| +T | next_permutation (T... args) |
| +T | isblank (T... args) |
| +T | noshowpoint (T... args) |
| +T | atan2 (T... args) |
| +T | nanf (T... args) |
| +T | towctrans (T... args) |
| +T | right (T... args) |
| +T | fputwc (T... args) |
| +T | strtoul (T... args) |
| +T | is_heap (T... args) |
| +T | fflush (T... args) |
| +T | strtoumax (T... args) |
| +T | nexttoward (T... args) |
| +T | nounitbuf (T... args) |
| +T | ispunct (T... args) |
| +T | noboolalpha (T... args) |
| +T | make_pair (T... args) |
| +T | iswctype (T... args) |
| +T | srand (T... args) |
| +T | replace_copy (T... args) |
| +T | future_category (T... args) |
| +T | resetiosflags (T... args) |
| +T | vprintf (T... args) |
| +T | gmtime (T... args) |
| +T | align (T... args) |
| +T | tuple_cat (T... args) |
| +T | ends (T... args) |
| +T | set_terminate (T... args) |
| +T | lrint (T... args) |
| +T | none_of (T... args) |
| +T | wscanf (T... args) |
| +T | fputc (T... args) |
| +T | dec (T... args) |
| +T | strcat (T... args) |
| +T | raise (T... args) |
| +T | wcsspn (T... args) |
| +T | fabs (T... args) |
| +T | wmemcpy (T... args) |
| +T | copy_n (T... args) |
| +T | rethrow_if_nested (T... args) |
| +T | setlocale (T... args) |
| +T | addressof (T... args) |
| +T | calloc (T... args) |
| +T | strerror (T... args) |
| +T | strcpy (T... args) |
| +T | wcstoull (T... args) |
| +T | c16rtomb (T... args) |
| +T | generate_canonical (T... args) |
| +T | vfprintf (T... args) |
| +T | notify_all_at_thread_exit (T... args) |
| +T | rotate (T... args) |
| +T | current_exception (T... args) |
| +T | strtok (T... args) |
| +T | wcscat (T... args) |
| +T | strncpy (T... args) |
| +T | towlower (T... args) |
| +T | floor (T... args) |
| +T | left (T... args) |
| +T | ferror (T... args) |
| +T | atomic_load_explicit (T... args) |
| +T | swap (T... args) |
| +T | acos (T... args) |
| +T | wcscoll (T... args) |
| +T | sqrt (T... args) |
| +T | mbsinit (T... args) |
| +T | qsort (T... args) |
| +T | stoll (T... args) |
| +T | put_money (T... args) |
| +T | wcstoul (T... args) |
| +T | wcstol (T... args) |
| +T | atexit (T... args) |
| +T | atomic_fetch_or (T... args) |
| +T | rewind (T... args) |
| +T | wcsxfrm (T... args) |
| +T | round (T... args) |
| +T | vwprintf (T... args) |
| +T | all_of (T... args) |
| +T | replace (T... args) |
| +T | remquo (T... args) |
| +T | setbuf (T... args) |
| +T | strncmp (T... args) |
| +T | localeconv (T... args) |
| +T | wctrans (T... args) |
| +T | any_of (T... args) |
| +T | equal (T... args) |
| +T | max (T... args) |
| +T | strxfrm (T... args) |
| +T | iswxdigit (T... args) |
| +T | labs (T... args) |
| +T | regex_match (T... args) |
| +T | fputws (T... args) |
| +T | wcrtomb (T... args) |
| +T | setprecision (T... args) |
| +T | setvbuf (T... args) |
| +T | regex_replace (T... args) |
| +T | freopen (T... args) |
| +T | logb (T... args) |
| +T | wctob (T... args) |
| +T | atomic_load (T... args) |
| +T | search_n (T... args) |
| +T | toupper (T... args) |
| +T | move_backward (T... args) |
| +T | is_sorted (T... args) |
| +T | strtoull (T... args) |
| +T | iswblank (T... args) |
| +T | get_pointer_safety (T... args) |
| +T | get_unexpected (T... args) |
| +T | sscanf (T... args) |
| +T | fesetenv (T... args) |
| +T | atomic_store_explicit (T... args) |
| +T | strtold (T... args) |
| +T | fread (T... args) |
| +T | memchr (T... args) |
| +T | btowc (T... args) |
| +T | replace_if (T... args) |
| +T | strcoll (T... args) |
| +T | vsprintf (T... args) |
| +T | mismatch (T... args) |
| +T | getchar (T... args) |
| +T | islower (T... args) |
| +T | tmpnam (T... args) |
| +T | nanl (T... args) |
| +T | fopen (T... args) |
| +T | for_each (T... args) |
| +T | fegetround (T... args) |
| +T | ungetc (T... args) |
| +T | internal (T... args) |
| +T | vfwscanf (T... args) |
| +T | fgetc (T... args) |
| +T | wcstof (T... args) |
| +T | bind (T... args) |
| +T | skipws (T... args) |
| +T | iswprint (T... args) |
| +T | wcstombs (T... args) |
| +T | inplace_merge (T... args) |
| +T | copysign (T... args) |
| +T | putwchar (T... args) |
| +T | wcsstr (T... args) |
| +T | fegetenv (T... args) |
| +T | longjmp (T... args) |
| +T | iswcntrl (T... args) |
| +T | declare_no_pointers (T... args) |
| +T | isnormal (T... args) |
| +T | swap_ranges (T... args) |
| +T | minmax (T... args) |
| +T | defaultfloat (T... args) |
| +T | rename (T... args) |
| +T | snprintf (T... args) |
| +T | try_lock (T... args) |
| +T | stoul (T... args) |
| +T | fgetpos (T... args) |
| +T | partition_copy (T... args) |
| +T | vscanf (T... args) |
| +T | front_inserter (T... args) |
| +T | get_terminate (T... args) |
| +T | cosh (T... args) |
| +T | prev (T... args) |
| +T | strchr (T... args) |
| +T | strstr (T... args) |
| +T | printf (T... args) |
| +T | setfill (T... args) |
| +T | inner_product (T... args) |
STL namespace.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main). +More...
+#include <iostream>+Macros | |
| #define | MAX 10000000 |
+Functions | |
| void | sieve (uint32_t N) |
| void | print (uint32_t N) |
| void | init () |
| int | main () |
+Variables | |
| bool | isprime [MAX] |
Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main).
+Time Complexity : \(O(N \cdot\log N)\)
+Space Complexity : \(O(N)\)
| #define MAX 10000000 | +
Maximum number of primes
+ +| void init | +( | +) | ++ |
| int main | +( | +) | ++ |
| void print | +( | +uint32_t | +N | ) | ++ |
| void sieve | +( | +uint32_t | +N | ) | ++ |
This is the function that finds the primes and eliminates the multiples.
+ +| bool isprime[MAX] | +
array to store the primes
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
A simple tree implementation using nodes. +More...
+#include <algorithm>#include <iostream>#include <queue>+Classes | |
| class | node< Kind > |
+Typedefs | |
| +typedef struct node | node |
+Functions | |
| node * | createNode (int data) |
| int | height (node *root) |
| int | getBalance (node *root) |
| node * | rightRotate (node *root) |
| node * | leftRotate (node *root) |
| node * | minValue (node *root) |
| node * | insert (node *root, int item) |
| node * | deleteNode (node *root, int key) |
| void | levelOrder (node *root) |
| int | main () |
A simple tree implementation using nodes.
+| node* createNode | +( | +int | +data | ) | ++ |
Balanced Deletion
+| int getBalance | +( | +node * | +root | ) | ++ |
| int height | +( | +node * | +root | ) | ++ |
Balanced Insertion
+| void levelOrder | +( | +node * | +root | ) | ++ |
LevelOrder (Breadth First Search)
+| int main | +( | +) | ++ |
Main function
+Returns node with minimum value in the tree
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
C++ program to find factorial of given number. +More...
+#include <iostream>+Functions | |
| unsigned int | factorial (unsigned int n) |
| int | main () |
C++ program to find factorial of given number.
+| unsigned int factorial | +( | +unsigned int | +n | ) | ++ |
function to find factorial of given number
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Linear search algorithm +More...
+#include <iostream>+Functions | |
| int | LinearSearch (int *array, int size, int key) |
| int | main () |
| int LinearSearch | +( | +int * | +array, | +
| + | + | int | +size, | +
| + | + | int | +key | +
| + | ) | ++ |
Algorithm implementation
| [in] | array | array to search in |
| [in] | size | length of array |
| [in] | key | key value to search for |
| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
String search algorithms. +More...
++Functions | |
| int | brute_force (const std::string &text, const std::string &pattern) |
| std::vector< int > | getFailureArray (const std::string &pattern) |
| bool | kmp (const std::string &pattern, const std::string &text) |
| int64_t | create_hash (const std::string &s, int n) |
| int64_t | recalculate_hash (const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength) |
| bool | check_if_equal (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2) |
| int | rabin_karp (const std::string &str, const std::string &pat) |
String search algorithms.
+| int string_search::brute_force | +( | +const std::string & | +text, | +
| + | + | const std::string & | +pattern | +
| + | ) | ++ |
Find a pattern in a string by comparing the pattern to every substring.
| text | Any string that might contain the pattern. |
| pattern | String that we are searching for. |
| bool string_search::check_if_equal | +( | +const std::string & | +str1, | +
| + | + | const std::string & | +str2, | +
| + | + | int | +start1, | +
| + | + | int | +end1, | +
| + | + | int | +start2, | +
| + | + | int | +end2 | +
| + | ) | ++ |
compare if two sub-strings are equal
| [in] | str1 | string pattern to search |
| [in] | str2 | text in which to search |
| [in] | start1,end1 | start and end indices for substring in str1 |
| [in] | start2,end2 | start and end indices for substring in str2 |
true if pattern was found false if pattern was not found | int64_t string_search::create_hash | +( | +const std::string & | +s, | +
| + | + | int | +n | +
| + | ) | ++ |
convert a string to an intger - called as hashing function
| [in] | s | source of string to hash |
| [in] | n | length of substring to hash |
| std::vector<int> string_search::getFailureArray | +( | +const std::string & | +pattern | ) | ++ |
Generate the partial match table aka failure function for a pattern to search.
| [in] | pattern | text for which to create the partial match table |
| bool string_search::kmp | +( | +const std::string & | +pattern, | +
| + | + | const std::string & | +text | +
| + | ) | ++ |
KMP algorithm to find a pattern in a text
| [in] | pattern | string pattern to search |
| [in] | text | text in which to search |
true if pattern was found false if pattern was not found | int string_search::rabin_karp | +( | +const std::string & | +str, | +
| + | + | const std::string & | +pat | +
| + | ) | ++ |
Perform string pattern search using Rabin-Karp algorithm
| [in] | str | string to search in |
| [in] | pat | pattern to search for |
| int64_t string_search::recalculate_hash | +( | +const std::string & | +s, | +
| + | + | int | +old_index, | +
| + | + | int | +new_index, | +
| + | + | int64_t | +old_hash, | +
| + | + | int | +patLength | +
| + | ) | ++ |
re-hash a string using known existing hash
| [in] | s | source of string to hash |
| [in] | old_index | previous index of string |
| [in] | new_index | new index of string |
| [in] | old_hash | previous hash of substring |
| [in] | patLength | length of substring to hash |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for queue< Kind >, including all inherited members.
+| clear() | queue< Kind > | inline |
| deQueue() | queue< Kind > | inline |
| display() | queue< Kind > | inline |
| enQueue(Kind item) | queue< Kind > | inline |
| front (defined in queue< Kind >) | queue< Kind > | |
| front() | queue< Kind > | inline |
| isEmptyQueue() | queue< Kind > | inline |
| queue() | queue< Kind > | inline |
| queueFront | queue< Kind > | private |
| queueRear | queue< Kind > | private |
| rear (defined in queue< Kind >) | queue< Kind > | |
| size (defined in queue< Kind >) | queue< Kind > | private |
| t (defined in queue< Kind >) | queue< Kind > | |
| ~queue() | queue< Kind > | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for machine_learning::adaline, including all inherited members.
+| accuracy | machine_learning::adaline | private |
| activation(double x) (defined in machine_learning::adaline) | machine_learning::adaline | inline |
| adaline(int num_features, const double eta=0.01f, const double accuracy=1e-5) | machine_learning::adaline | inline |
| check_size_match(const std::vector< double > &x) | machine_learning::adaline | inlineprivate |
| eta | machine_learning::adaline | private |
| fit(const std::vector< double > &x, const int &y) | machine_learning::adaline | inline |
| fit(std::vector< double > const (&X)[N], const int *y) | machine_learning::adaline | inline |
| operator<<(std::ostream &out, const adaline &ada) | machine_learning::adaline | friend |
| predict(const std::vector< double > &x, double *out=nullptr) | machine_learning::adaline | inline |
| weights | machine_learning::adaline | private |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
#include <cmath>#include <iostream>+Functions | |
| double | poisson_rate (double events, double timeframe) |
| double | poisson_expected (double rate, double time) |
| double | fact (double x) |
| double | poisson_x_successes (double expected, double x) |
| double | poisson_range_successes (double expected, double lower, double upper) |
| int | main () |
The Poisson distribution counts how many events occur over a set time interval.
+| double fact | +( | +double | +x | ) | ++ |
| int main | +( | +) | ++ |
main function
+| double poisson_expected | +( | +double | +rate, | +
| + | + | double | +time | +
| + | ) | ++ |
calculate the expected value over a time e.g rate of 2.5 over 10 mins = 2.5 x 10 = 25
+| double poisson_range_successes | +( | +double | +expected, | +
| + | + | double | +lower, | +
| + | + | double | +upper | +
| + | ) | ++ |
probability of a success in range for Poisson dist (inclusive, inclusive)
+\[P = \sum_i p(\mu,i)\] +
+| double poisson_rate | +( | +double | +events, | +
| + | + | double | +timeframe | +
| + | ) | ++ |
| double poisson_x_successes | +( | +double | +expected, | +
| + | + | double | +x | +
| + | ) | ++ |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Kohonen self organizing map (data tracing) +More...
+#include <algorithm>#include <cmath>#include <cstdlib>#include <ctime>#include <fstream>#include <iostream>#include <valarray>#include <vector>+Namespaces | |
| machine_learning | |
| Machine learning algorithms. | |
+Functions | |
| double | _random (double a, double b) |
| int | save_nd_data (const char *fname, const std::vector< std::valarray< double >> &X) |
| void | machine_learning::update_weights (const std::valarray< double > &x, std::vector< std::valarray< double >> *W, std::valarray< double > *D, double alpha, int R) |
| void | machine_learning::kohonen_som_tracer (const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min) |
| void | test_circle (std::vector< std::valarray< double >> *data) |
| void | test1 () |
| void | test_lamniscate (std::vector< std::valarray< double >> *data) |
| void | test2 () |
| void | test_3d_classes (std::vector< std::valarray< double >> *data) |
| void | test3 () |
| double | get_clock_diff (clock_t start_t, clock_t end_t) |
| int | main (int argc, char **argv) |
Kohonen self organizing map (data tracing)
+This example implements a powerful self organizing map algorithm. The algorithm creates a connected network of weights that closely follows the given data points. This this creates a chain of nodes that resembles the given input shape.
+ +| double get_clock_diff | +( | +clock_t | +start_t, | +
| + | + | clock_t | +end_t | +
| + | ) | ++ |
| int main | +( | +int | +argc, | +
| + | + | char ** | +argv | +
| + | ) | ++ |
Main function
+| void test1 | +( | +) | ++ |
Test that creates a random set of points distributed near the circumference of a circle and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:
test1.csv: random test samples points with a circular patternw11.csv: initial random mapw12.csv: trained SOM mapThe outputs can be readily plotted in gnuplot using the following snippet
| void test2 | +( | +) | ++ |
Test that creates a random set of points distributed near the locus of the Lamniscate of Gerono and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:
test2.csv: random test samples points with a lamniscate patternw21.csv: initial random mapw22.csv: trained SOM mapThe outputs can be readily plotted in gnuplot using the following snippet
| void test3 | +( | +) | ++ |
Test that creates a random set of points distributed in six clusters in 3D space. The following CSV files are created to validate the execution:
test3.csv: random test samples points with a circular patternw31.csv: initial random mapw32.csv: trained SOM mapThe outputs can be readily plotted in gnuplot using the following snippet
| void test_3d_classes | +( | +std::vector< std::valarray< double >> * | +data | ) | ++ |
Creates a random set of points distributed in six clusters in 3D space with centroids at the points
| [out] | data | matrix to store data in |
| void test_circle | +( | +std::vector< std::valarray< double >> * | +data | ) | ++ |
Creates a random set of points distributed near the circumference of a circle and trains an SOM that finds that circular pattern. The generating function is
+\begin{eqnarray*} r &\in& [1-\delta r, 1+\delta r)\\ \theta &\in& [0, 2\pi)\\ x &=& r\cos\theta\\ y &=& r\sin\theta \end{eqnarray*} +
+| [out] | data | matrix to store data in |
| void test_lamniscate | +( | +std::vector< std::valarray< double >> * | +data | ) | ++ |
Creates a random set of points distributed near the locus of the Lamniscate of Gerono.
+\begin{eqnarray*} \delta r &=& 0.2\\ \delta x &\in& [-\delta r, \delta r)\\ \delta y &\in& [-\delta r, \delta r)\\ \theta &\in& [0, \pi)\\ x &=& \delta x + \cos\theta\\ y &=& \delta y + \frac{\sin(2\theta)}{2} \end{eqnarray*} +
+| [out] | data | matrix to store data in |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
GCD using extended Euclid's algorithm +More...
+#include <algorithm>#include <iostream>+Functions | |
| template<typename T , typename T2 > | |
| void | update_step (T *r, T *r0, const T2 quotient) |
| template<typename T1 , typename T2 > | |
| void | extendedEuclid_1 (T1 A, T1 B, T1 *GCD, T2 *x, T2 *y) |
| template<typename T , typename T2 > | |
| void | extendedEuclid (T A, T B, T *GCD, T2 *x, T2 *y) |
| +int | main () |
| Main function. | |
GCD using extended Euclid's algorithm
+Finding coefficients of a and b ie x and y in Bézout's identity
+\[\text{gcd}(a, b) = a \times x + b \times y \] +
+This is also used in finding Modular multiplicative inverse of a number. (A * B)M == 1 Here B is the MMI of A for given M, so extendedEuclid (A, M) gives B.
+| void extendedEuclid | +( | +T | +A, | +
| + | + | T | +B, | +
| + | + | T * | +GCD, | +
| + | + | T2 * | +x, | +
| + | + | T2 * | +y | +
| + | ) | ++ |
Implementation using recursive algorithm
+| [in] | A | unsigned |
| [in] | B | unsigned |
| [out] | GCD | unsigned |
| [in,out] | x | signed |
| [in,out] | y | signed |
| void extendedEuclid_1 | +( | +T1 | +A, | +
| + | + | T1 | +B, | +
| + | + | T1 * | +GCD, | +
| + | + | T2 * | +x, | +
| + | + | T2 * | +y | +
| + | ) | ++ |
Implementation using iterative algorithm from Wikipedia
+| [in] | A | unsigned |
| [in] | B | unsigned |
| [out] | GCD | unsigned |
| [out] | x | signed |
| [out] | y | signed |
+
|
+ +inline | +
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | adaline_learning.cpp |
| Adaptive Linear Neuron (ADALINE) implementation | |
| file | kohonen_som_topology.cpp |
| Kohonen self organizing map (topological map) | |
| file | kohonen_som_trace.cpp |
| Kohonen self organizing map (data tracing) | |
+Namespaces | |
| machine_learning | |
| Machine learning algorithms. | |
+Macros | |
| +#define | MAX_ITER 500 |
| +#define | _USE_MATH_DEFINES |
| +#define | _USE_MATH_DEFINES |
+Functions | |
| double | _random (double a, double b) |
| int | save_2d_data (const char *fname, const std::vector< std::valarray< double >> &X) |
| void | get_min_2d (const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx) |
| int | save_nd_data (const char *fname, const std::vector< std::valarray< double >> &X) |
| double _random | +( | +double | +a, | +
| + | + | double | +b | +
| + | ) | ++ |
Helper function to generate a random number in a given interval.
+ Steps:
r1 = rand() % 100 gets a random number between 0 and 99r2 = r1 / 100 converts random number to be between 0 and 0.99| [in] | a | lower limit |
| [in] | b | upper limit |
| void get_min_2d | +( | +const std::vector< std::valarray< double >> & | +X, | +
| + | + | double * | +val, | +
| + | + | int * | +x_idx, | +
| + | + | int * | +y_idx | +
| + | ) | ++ |
Get minimum value and index of the value in a matrix
| [in] | X | matrix to search |
| [in] | N | number of points in the vector |
| [out] | val | minimum value found |
| [out] | idx_x | x-index where minimum value was found |
| [out] | idx_y | y-index where minimum value was found |
| int save_2d_data | +( | +const char * | +fname, | +
| + | + | const std::vector< std::valarray< double >> & | +X | +
| + | ) | ++ |
Save a given n-dimensional data martix to file.
+| [in] | fname | filename to save in (gets overwriten without confirmation) |
| [in] | X | matrix to save |
| int save_nd_data | +( | +const char * | +fname, | +
| + | + | const std::vector< std::valarray< double >> & | +X | +
| + | ) | ++ |
Save a given n-dimensional data martix to file.
+| [in] | fname | filename to save in (gets overwriten without confirmation) |
| [in] | X | matrix to save |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Median search algorithm +More...
+#include <algorithm>#include <iostream>#include <vector>| +#define | MAX_NUM 20 |
| maximum number of values to sort from | |
| template<class X > | |
| void | comp (X x, std::vector< int > *s1, std::vector< int > *s2, std::vector< int > *s3) |
| int | main () |
Median search algorithm
+| void comp | +( | +X | +x, | +
| + | + | std::vector< int > * | +s1, | +
| + | + | std::vector< int > * | +s2, | +
| + | + | std::vector< int > * | +s3 | +
| + | ) | ++ |
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Generate fibonacci sequence. +More...
+#include <cassert>#include <iostream>+Functions | |
| int | fibonacci (unsigned int n) |
| +int | main () |
| Main function. | |
Generate fibonacci sequence.
+Calculate the the value on Fibonacci's sequence given an integer as input.
+\[\text{fib}(n) = \text{fib}(n-1) + \text{fib}(n-2)\] +
+ +| int fibonacci | +( | +unsigned int | +n | ) | ++ |
Recursively compute sequences
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Interpolation search algorithm +More...
+#include <iostream>+Functions | |
| int | interpolation_search (int arr[], int value, int len) |
| int | main () |
Interpolation search algorithm
+| int interpolation_search | +( | +int | +arr[], | +
| + | + | int | +value, | +
| + | + | int | +len | +
| + | ) | ++ |
function to search the value in an array using interpolation search
| [in] | arr | array to search in |
| [in] | value | value to search for |
| [in] | len | length of array |
| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
C++ Program to find Euler's Totient function. +More...
+#include <cstdlib>#include <iostream>+Functions | |
| uint64_t | phiFunction (uint64_t n) |
| +int | main (int argc, char *argv[]) |
| Main function. | |
C++ Program to find Euler's Totient function.
+Euler Totient Function is also known as phi function.
+\[\phi(n) = \phi\left({p_1}^{a_1}\right)\cdot\phi\left({p_2}^{a_2}\right)\ldots\] +
+ where \(p_1\), \(p_2\), \(\ldots\) are prime factors of n.
+3 Euler's properties:
Applying this 3 properties on the first equation.
+\[\phi(n) = n\cdot\left(1-\frac{1}{p_1}\right)\cdot\left(1-\frac{1}{p_2}\right)\cdots\] +
+ where \(p_1\), \(p_2\)... are prime factors. Hence Implementation in \(O\left(\sqrt{n}\right)\).
+Some known values are:
| uint64_t phiFunction | +( | +uint64_t | +n | ) | ++ |
Function to caculate Euler's totient phi
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding. +More...
+#include <cassert>#include <iostream>+Functions | |
| double | Sqrt (double a) |
| int | main () |
Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding.
+| int main | +( | +) | ++ |
main function
+| double Sqrt | +( | +double | +a | ) | ++ |
Bisection method implemented for the function \(x^2-a=0\) whose roots are \(\pm\sqrt{a}\) and only the positive root is returned.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Primality test implementation. +More...
+#include <iostream>+Functions | |
| bool | IsPrime (int number) |
| int | main () |
Primality test implementation.
+A simple and efficient implementation of a function to test if a number is prime, based on the fact that
++Every Prime number, except 2 and 3, are of the form \(6k\pm1\) for integer values of k.
+
This gives a 3x speed improvement.
+| bool IsPrime | +( | +int | +number | ) | ++ |
Check if a number is prime
| [in] | number | number to check |
| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| + | Graph (int V, int E) |
| +void | addEdge (int src, int dst, int weight) |
| + | Graph (int V) |
| +void | addEdge (int src, int dst, int weight) |
| + | Graph (Graph &&)=default |
| +Graph & | operator= (Graph &&)=default |
| + | Graph (Graph const &)=default |
| +Graph & | operator= (Graph const &)=default |
| Graph (unsigned int vertices, AdjList const &adjList) | |
| Graph (unsigned int vertices, AdjList &&adjList) | |
| Graph (unsigned int vertices, std::vector< Edge > const &edges) | |
| std::remove_reference_t< AdjList > const & | getAdjList () const |
| std::remove_reference_t< unsigned int > const & | getVertices () const |
| void | addVertices (unsigned int num=1) |
| void | addEdge (Edge const &edge) |
| void | addEdge (unsigned int source, unsigned int destination) |
| +void | set_graph (void) |
| +void | ford_fulkerson (void) |
| +void | print_flow_info (void) |
| + | Graph (const int V) |
| +void | addEdge (int src, int dst, int weight) |
+Public Attributes | |
| +int | vertexNum |
| +int | edgeNum |
| +Edge * | edges |
| +int ** | edges |
+Private Member Functions | |
| +bool | bfs (int source, int sink) |
+Private Attributes | |
| +unsigned int | m_vertices |
| +AdjList | m_adjList |
| +int | residual_capacity [MAXN][MAXN] |
| +int | capacity [MAXN][MAXN] |
| +int | total_nodes |
| +int | total_edges |
| +int | source |
| +int | sink |
| +int | parent [MAXN] |
| +std::vector< std::tuple< int, int, int > > | edge_participated |
| +std::bitset< MAXN > | visited |
| +int | max_flow = 0 |
Implementation of graph class.
+The graph will be represented using Adjacency List representation. This class contains 2 data members "m_vertices" & "m_adjList" used to represent the number of vertices and adjacency list of the graph respectively. The vertices are labelled 0 - (m_vertices - 1).
+
+
|
+ +inline | +
+
|
+ +inline | +
+
|
+ +inline | +
Create a graph from vertices and a set of edges.
+Adjacency list of the graph would be created from the set of edges. If the source or destination of any edge has a value greater or equal to number of vertices, then it would throw a range_error.
+| vertices | specify the number of vertices the graph would contain. |
| edges | is a vector of edges. |
+
|
+ +inline | +
Add an edge in the graph.
+| edge | that needs to be added. |
+
|
+ +inline | +
Add an Edge in the graph
+| source | is source vertex of the edge. |
| destination | is the destination vertex of the edge. |
+
|
+ +inline | +
+
|
+ +inline | +
+
|
+ +inline | +
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Check if a number is palindrome or not. +More...
+#include <algorithm>#include <iostream>#include <cstring>+Functions | |
| int | main () |
Check if a number is palindrome or not.
+This program cheats by using the STL library's std::reverse function.
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Convert decimal number to hexadecimal representation. +More...
+#include <iostream>+Functions | |
| int | main (void) |
Convert decimal number to hexadecimal representation.
+| int main | +( | +void | +) | ++ |
Main program
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm +More...
+#include <algorithm>#include <cassert>#include <cmath>#include <complex>#include <cstdlib>#include <ctime>#include <fstream>#include <iostream>#include <valarray>+Macros | |
| #define | ACCURACY 1e-10 |
| +#define | MAX_BUFF_SIZE 50 |
+Functions | |
| std::complex< double > | poly_function (const std::valarray< double > &coeffs, std::complex< double > x) |
| const char * | complex_str (const std::complex< double > &x) |
| bool | check_termination (long double delta) |
| std::pair< uint32_t, double > | durand_kerner_algo (const std::valarray< double > &coeffs, std::valarray< std::complex< double >> *roots, bool write_log=false) |
| void | test1 () |
| void | test2 () |
| +int | main (int argc, char **argv) |
Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm
+ +Test the algorithm online: https://gist.github.com/kvedala/27f1b0b6502af935f6917673ec43bcd7
+Try the highly unstable Wilkinson's polynomial:
Sample implementation results to compute approximate roots of the equation \(x^4-1=0\):
+
| #define ACCURACY 1e-10 | +
maximum accuracy limit
+ +| bool check_termination | +( | +long double | +delta | ) | ++ |
check for termination condition
| [in] | delta | point at which to evaluate the polynomial |
false if termination not reached true if termination reached | const char* complex_str | +( | +const std::complex< double > & | +x | ) | ++ |
create a textual form of complex number
| [in] | x | point at which to evaluate the polynomial |
| std::pair<uint32_t, double> durand_kerner_algo | +( | +const std::valarray< double > & | +coeffs, | +
| + | + | std::valarray< std::complex< double >> * | +roots, | +
| + | + | bool | +write_log = false |
+
| + | ) | ++ |
Implements Durand Kerner iterative algorithm to compute all roots of a polynomial.
+| [in] | coeffs | coefficients of the polynomial |
| [out] | roots | the computed roots of the polynomial |
| [in] | write_log | flag whether to save the log file (default = false) |
| std::complex<double> poly_function | +( | +const std::valarray< double > & | +coeffs, | +
| + | + | std::complex< double > | +x | +
| + | ) | ++ |
Evaluate the value of a polynomial with given coefficients
| [in] | coeffs | coefficients of the polynomial |
| [in] | x | point at which to evaluate the polynomial |
| void test1 | +( | +) | ++ |
Self test the algorithm by checking the roots for \(x^2+4=0\) to which the roots are \(0 \pm 2i\)
+| void test2 | +( | +) | ++ |
Self test the algorithm by checking the roots for \(0.015625x^3-1=0\) to which the roots are \((4+0i),\,(-2\pm3.464i)\)
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Print the elements of a matrix traversing it spirally. +More...
+#include <iostream>+Functions | |
| void | genArray (int **a, int r, int c) |
| void | spiralPrint (int **a, int r, int c) |
| int | main () |
Print the elements of a matrix traversing it spirally.
+| void genArray | +( | +int ** | +a, | +
| + | + | int | +r, | +
| + | + | int | +c | +
| + | ) | ++ |
Arrange sequence of numbers from '1' in a matrix form
| [out] | a | matrix to fill |
| [in] | r | number of rows |
| [in] | c | number of columns |
| int main | +( | +) | ++ |
| void spiralPrint | +( | +int ** | +a, | +
| + | + | int | +r, | +
| + | + | int | +c | +
| + | ) | ++ |
Traverse the matrix spirally and print the sequence of elements
| [in] | a | matrix to read from |
| [in] | r | number of rows |
| [in] | c | number of columns |
Print start row
+Print the end col
+Print the end row
+Print the start Col
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Prime factorization of positive integers. +More...
+#include <algorithm>#include <cstring>#include <iostream>#include <vector>+Functions | |
| void | SieveOfEratosthenes (int N) |
| void | prime_factorization (int num) |
| int | main () |
+Variables | |
| bool | isprime [1000006] |
| std::vector< int > | prime_numbers |
| std::vector< std::pair< int, int > > | factors |
Prime factorization of positive integers.
+| int main | +( | +) | ++ |
Main program
+| void prime_factorization | +( | +int | +num | ) | ++ |
Prime factorization of a number
+| void SieveOfEratosthenes | +( | +int | +N | ) | ++ |
Calculating prime number upto a given range
+| std::vector<std::pair<int, int> > factors | +
list of prime factor-pairs
+ +| bool isprime[1000006] | +
Declaring variables for maintaing prime numbers and to check whether a number is prime or not
+ +| std::vector<int> prime_numbers | +
list of prime numbers
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Solve the Tower of Hanoi problem. +More...
+#include <iostream>+Classes | |
| struct | tower |
+Functions | |
| void | show (const struct tower *const F, const struct tower *const T, const struct tower *const U) |
| void | mov (tower *From, tower *To) |
| void | TH (int n, tower *From, tower *Using, tower *To) |
| int | main () |
Solve the Tower of Hanoi problem.
+| int main | +( | +) | ++ |
Main function
+| void show | +( | +const struct tower *const | +F, | +
| + | + | const struct tower *const | +T, | +
| + | + | const struct tower *const | +U | +
| + | ) | ++ |
Display the towers
+| void TH | +( | +int | +n, | +
| + | + | tower * | +From, | +
| + | + | tower * | +Using, | +
| + | + | tower * | +To | +
| + | ) | ++ |
Recursive algorithm to solve the puzzle
| [in] | n | starting number of disks |
| [in,out] | From | tower to move disks from |
| [in,out] | Using | temporary tower for the puzzle |
| [in,out] | To | tower to move disk to |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
#include <large_number.h>
+Public Member Functions | |
| large_number () | |
| large_number (int n) | |
| large_number (const large_number &a) | |
| large_number (std::vector< unsigned char > &vec) | |
| + | large_number (char const *number_str) |
| void | add_digit (unsigned int value) |
| const size_t | num_digits () const |
| unsigned char & | operator[] (size_t n) |
| +const unsigned char & | operator[] (size_t n) const |
| large_number & | operator++ () |
| large_number & | operator++ (int) |
| large_number & | operator+= (large_number n) |
| +large_number & | operator+= (int n) |
| large_number & | operator= (const large_number &b) |
| template<class T > | |
| large_number & | operator*= (const T n) |
| const char | digit_char (size_t i) const |
+Static Public Member Functions | |
| static bool | test () |
+Private Member Functions | |
| template<class T > | |
| void | multiply (const T n) |
+Private Attributes | |
| std::vector< unsigned char > | _digits |
+Friends | |
| std::ostream & | operator<< (std::ostream &out, const large_number &a) |
| bool | operator== (large_number const &a, large_number const &b) |
| bool | operator!= (large_number const &a, large_number const &b) |
| template<class T > | |
| large_number & | operator+ (const large_number &a, const T &b) |
Store large unsigned numbers as a C++ vector The class provides convenience functions to add a digit to the number, perform multiplication of large number with long unsigned integers.
+
+
|
+ +inline | +
+
|
+ +inlineexplicit | +
< initializer from an integer initializer from another large_number
+
+
|
+ +inline | +
initializer from a vector
+ +
+
|
+ +inlineexplicit | +
initializer from a string
+ +
+
|
+ +inline | +
+
|
+ +inline | +
returns i^th digit as an ASCII character
+
+
|
+ +inlineprivate | +
multiply large number with another integer and store the result in the same large number
+
+
|
+ +inline | +
+
|
+ +inline | +
operator overload to increment
+
+
|
+ +inline | +
+
|
+ +inline | +
operator overload to increment (postfix)
+ +
+
|
+ +inline | +
operator overload to add
+
+
|
+ +inline | +
+
|
+ +inline | +
operator over load to access the i^th digit conveniently and also assign value to it
+
+
|
+ +inlinestatic | +
Function to check implementation
+
+
|
+ +friend | +
operator overload to compare two numbers
+ +
+
|
+ +friend | +
operator overload to perform addition
+ +
+
|
+ +friend | +
+
|
+ +friend | +
+
|
+ +private | +
where individual digits are stored
+ +|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| + | Node (int v, Node *n) |
+Public Attributes | |
| +int | data |
| +int | next |
| +struct Node * | next |
| +int | val |
| +Node * | next |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime. +More...
+#include <cassert>#include <iostream>+Functions | |
| template<typename T > | |
| bool | is_prime (T num) |
| int | main () |
Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime.
+Copyright 2020
+A simple program to check if the given number if prime or not.
+| bool is_prime | +( | +T | +num | ) | ++ |
Function to check if the given number is prime or not.
| num | number to be checked. |
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method +More...
+#include <cmath>#include <ctime>#include <fstream>#include <iostream>#include <valarray>+Functions | |
| void | problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Problem statement for a system with first-order differential equations. Updates the system differential variables. More... | |
| void | exact_solution (const double &x, std::valarray< double > *y) |
| Exact solution of the problem. Used for solution comparison. More... | |
| void | forward_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy) |
| Compute next step approximation using the forward-Euler method. More... | |
| double | forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false) |
| Compute approximation using the forward-Euler method in the given limits. More... | |
| void | save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0) |
| int | main (int argc, char *argv[]) |
Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method
+ +The ODE being solved is:
+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*} +
+The exact solution for the above problem is:
+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*} +
+ The computation results are stored to a text file forward_euler.csv and the exact soltuion results in exact.csv for comparison.
To implement Van der Pol oscillator, change the problem function to:
| void exact_solution | +( | +const double & | +x, | +
| + | + | std::valarray< double > * | +y | +
| + | ) | ++ |
| int main | +( | +int | +argc, | +
| + | + | char * | +argv[] | +
| + | ) | ++ |
Main Function
+| void problem | +( | +const double & | +x, | +
| + | + | std::valarray< double > * | +y, | +
| + | + | std::valarray< double > * | +dy | +
| + | ) | ++ |
Problem statement for a system with first-order differential equations. Updates the system differential variables.
+| [in] | x | independent variable(s) |
| [in,out] | y | dependent variable(s) |
| [in,out] | dy | first-derivative of dependent variable(s) |
| void save_exact_solution | +( | +const double & | +X0, | +
| + | + | const double & | +X_MAX, | +
| + | + | const double & | +step_size, | +
| + | + | const std::valarray< double > & | +Y0 | +
| + | ) | ++ |
Function to compute and save exact solution for comparison
+| [in] | X0 | initial value of independent variable |
| [in] | X_MAX | final value of independent variable |
| [in] | step_size | independent variable step size |
| [in] | Y0 | initial values of dependent variables |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1. +More...
+#include <iostream>+Functions | |
| template<typename T > | |
| bool | is_happy (T n) |
| int | main () |
A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1.
+| bool is_happy | +( | +T | +n | ) | ++ |
Checks if a decimal number is a happy number
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Pascal's triangle implementation. +More...
+#include <cstring>#include <iomanip>#include <iostream>+Functions | |
| void | show_pascal (int **arr, int n) |
| int ** | pascal_triangle (int **arr, int n) |
| int | main () |
Pascal's triangle implementation.
+| int main | +( | +) | ++ |
main function
+| int** pascal_triangle | +( | +int ** | +arr, | +
| + | + | int | +n | +
| + | ) | ++ |
Print the triangle
| [in,out] | arr | array containing Pascal numbers |
| [in] | n | depth of Pascal triangle to print |
| void show_pascal | +( | +int ** | +arr, | +
| + | + | int | +n | +
| + | ) | ++ |
Print the triangle
| [in] | arr | 2D-array containing Pascal numbers |
| [in] | n | depth of Pascal triangle to print |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Linear regression example using Ordinary least squares +More...
+#include <iomanip>#include <iostream>#include <vector>+Functions | |
| template<typename T > | |
| std::ostream & | operator<< (std::ostream &out, std::vector< std::vector< T >> const &v) |
| template<typename T > | |
| std::ostream & | operator<< (std::ostream &out, std::vector< T > const &v) |
| template<typename T > | |
| bool | is_square (std::vector< std::vector< T >> const &A) |
| template<typename T > | |
| std::vector< std::vector< T > > | operator* (std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B) |
| template<typename T > | |
| std::vector< T > | operator* (std::vector< std::vector< T >> const &A, std::vector< T > const &B) |
| template<typename T > | |
| std::vector< float > | operator* (float const scalar, std::vector< T > const &A) |
| template<typename T > | |
| std::vector< float > | operator* (std::vector< T > const &A, float const scalar) |
| template<typename T > | |
| std::vector< float > | operator/ (std::vector< T > const &A, float const scalar) |
| template<typename T > | |
| std::vector< T > | operator- (std::vector< T > const &A, std::vector< T > const &B) |
| template<typename T > | |
| std::vector< T > | operator+ (std::vector< T > const &A, std::vector< T > const &B) |
| template<typename T > | |
| std::vector< std::vector< float > > | get_inverse (std::vector< std::vector< T >> const &A) |
| template<typename T > | |
| std::vector< std::vector< T > > | get_transpose (std::vector< std::vector< T >> const &A) |
| template<typename T > | |
| std::vector< float > | fit_OLS_regressor (std::vector< std::vector< T >> const &X, std::vector< T > const &Y) |
| template<typename T > | |
| std::vector< float > | predict_OLS_regressor (std::vector< std::vector< T >> const &X, std::vector< float > const &beta) |
| int | main () |
Linear regression example using Ordinary least squares
+ +| std::vector<float> fit_OLS_regressor | +( | +std::vector< std::vector< T >> const & | +X, | +
| + | + | std::vector< T > const & | +Y | +
| + | ) | ++ |
Perform Ordinary Least Squares curve fit. This operation is defined as
+\[\beta = \left(X^TXX^T\right)Y\] +
+| X | feature matrix with rows representing sample vector of features |
| Y | known regression value for each sample |
| std::vector<std::vector<float> > get_inverse | +( | +std::vector< std::vector< T >> const & | +A | ) | ++ |
Get matrix inverse using Row-trasnformations. Given matrix must be a square and non-singular.
| std::vector<std::vector<T> > get_transpose | +( | +std::vector< std::vector< T >> const & | +A | ) | ++ |
matrix transpose
+
|
+ +inline | +
function to check if given matrix is a square matrix
| int main | +( | +) | ++ |
main function
+| std::vector<float> operator* | +( | +float const | +scalar, | +
| + | + | std::vector< T > const & | +A | +
| + | ) | ++ |
pre-multiplication of a vector by a scalar
| std::vector<std::vector<T> > operator* | +( | +std::vector< std::vector< T >> const & | +A, | +
| + | + | std::vector< std::vector< T >> const & | +B | +
| + | ) | ++ |
Matrix multiplication such that if A is size (mxn) and B is of size (pxq) then the multiplication is defined only when n = p and the resultant matrix is of size (mxq)
+| std::vector<T> operator* | +( | +std::vector< std::vector< T >> const & | +A, | +
| + | + | std::vector< T > const & | +B | +
| + | ) | ++ |
multiplication of a matrix with a column vector
| std::vector<float> operator* | +( | +std::vector< T > const & | +A, | +
| + | + | float const | +scalar | +
| + | ) | ++ |
post-multiplication of a vector by a scalar
| std::vector<T> operator+ | +( | +std::vector< T > const & | +A, | +
| + | + | std::vector< T > const & | +B | +
| + | ) | ++ |
addition of two vectors of identical lengths
| std::vector<T> operator- | +( | +std::vector< T > const & | +A, | +
| + | + | std::vector< T > const & | +B | +
| + | ) | ++ |
subtraction of two vectors of identical lengths
| std::vector<float> operator/ | +( | +std::vector< T > const & | +A, | +
| + | + | float const | +scalar | +
| + | ) | ++ |
division of a vector by a scalar
| std::ostream& operator<< | +( | +std::ostream & | +out, | +
| + | + | std::vector< std::vector< T >> const & | +v | +
| + | ) | ++ |
operator to print a matrix
+| std::ostream& operator<< | +( | +std::ostream & | +out, | +
| + | + | std::vector< T > const & | +v | +
| + | ) | ++ |
operator to print a vector
+| std::vector<float> predict_OLS_regressor | +( | +std::vector< std::vector< T >> const & | +X, | +
| + | + | std::vector< float > const & | +beta | +
| + | ) | ++ |
Given data and OLS model coeffficients, predict regression estimates. This operation is defined as
+\[y_{\text{row}=i} = \sum_{j=\text{columns}}\beta_j\cdot X_{i,j}\] +
+| X | feature matrix with rows representing sample vector of features |
| beta | fitted regression model |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
A basic implementation of trie class to store only lower-case strings. +More...
+#include <iostream>#include <memory>#include <string>+Classes | |
| class | Trie |
| struct | Trie::TrieNode |
+Functions | |
| int | main () |
A basic implementation of trie class to store only lower-case strings.
+Copyright 2020
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Search for words in a long textual paragraph. +More...
+#include <cstdlib>#include <iostream>#include <cstring>+Functions | |
| int | main () |
Search for words in a long textual paragraph.
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Perform paranthesis matching. +More...
+#include <iostream>#include <cstring>+Macros | |
| #define | MAX 100 |
+Functions | |
| char | opening (char ch) |
| +int | main () |
| char | stack [MAX] |
| +int | top = -1 |
| pointer to track stack index | |
| +void | push (char ch) |
| push byte to stack variable | |
| +char | pop () |
| pop a byte out of stack variable | |
Perform paranthesis matching.
+| #define MAX 100 | +
check number
+ +| char opening | +( | +char | +ch | ) | ++ |
return opening paranthesis corresponding to the close paranthesis
| [in] | ch | closed paranthesis character |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Ternary search algorithm +More...
+#include <iostream>+Macros | |
| #define | absolutePrecision 10 |
| #define | _target 10 |
| +#define | MAX 10000000 |
| Maximum length of array. | |
+Functions | |
| void | get_input () |
| int | it_ternary_search (int left, int right, int A[], int target) |
| int | rec_ternary_search (int left, int right, int A[], int target) |
| void | ternary_search (int N, int A[], int target) |
| int | main () |
Ternary search algorithm
+This is a divide and conquer algorithm. It does this by dividing the search space by 3 parts and using its property (usually monotonic property) to find the desired index.
+| #define _target 10 | +
The value of _target should be decided or can be decided later by using the variable of the function.
+ +| #define absolutePrecision 10 | +
The absolutePrecision can be modified to fit preference but it is recommended to not go lower than 10 due to errors that may occur.
+ +| void get_input | +( | +) | ++ |
get_input function is to receive input from standard IO
| int it_ternary_search | +( | +int | +left, | +
| + | + | int | +right, | +
| + | + | int | +A[], | +
| + | + | int | +target | +
| + | ) | ++ |
This is the iterative method of the ternary search which returns the index of the element.
| [in] | left | lower interval limit |
| [in] | right | upper interval limit |
| [in] | A | array to search in |
| [in] | target | value to search for |
| int main | +( | +) | ++ |
Main function
+| int rec_ternary_search | +( | +int | +left, | +
| + | + | int | +right, | +
| + | + | int | +A[], | +
| + | + | int | +target | +
| + | ) | ++ |
This is the recursive method of the ternary search which returns the index of the element.
| [in] | left | lower interval limit |
| [in] | right | upper interval limit |
| [in] | A | array to search in |
| [in] | target | value to search for |
| void ternary_search | +( | +int | +N, | +
| + | + | int | +A[], | +
| + | + | int | +target | +
| + | ) | ++ |
ternary_search is a template function You could either use it_ternary_search or rec_ternary_search according to preference.
| [in] | N | length of array |
| [in] | A | array to search in |
| [in] | target | value to search for |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Queue, including all inherited members.
+| createNode(int val) (defined in Queue) | Queue | inline |
| dequeue() (defined in Queue) | Queue | inline |
| enqueue(int val) (defined in Queue) | Queue | inline |
| front (defined in Queue) | Queue | private |
| Queue() (defined in Queue) | Queue | inline |
| rear (defined in Queue) | Queue | private |
| traverse() (defined in Queue) | Queue | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Solve the equation \(f(x)=0\) using false position method, also known as the Secant method. +More...
+#include <cmath>#include <cstdlib>#include <iostream>#include <limits>+Macros | |
| +#define | EPSILON 1e-6 |
| +#define | MAX_ITERATIONS 50000 |
| Maximum number of iterations to check. | |
+Functions | |
| static double | eq (double i) |
| template<typename T > | |
| int | sgn (T val) |
| int | main () |
Solve the equation \(f(x)=0\) using false position method, also known as the Secant method.
+Given two points \(a\) and \(b\) such that \(f(a)<0\) and \(f(b)>0\), then the \((i+1)^\text{th}\) approximation is given by:
+\[ x_{i+1} = \frac{a_i\cdot f(b_i) - b_i\cdot f(a_i)}{f(b_i) - f(a_i)} \] +
+For the next iteration, the interval is selected as: \([a,x]\) if \(x>0\) or \([x,b]\) if \(x<0\). The Process is continued till a close enough approximation is achieved.
+ +
+
|
+ +static | +
define \(f(x)\) to find root for
+| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Classes | |
| struct | TrieNode |
+Public Member Functions | |
| + | Trie () |
| constructor to initialise the root of the trie. | |
| void | insert (const std::string &word) |
| bool | search (const std::string &word) |
| +void | removeWord (const std::string &word) |
+Private Member Functions | |
| std::shared_ptr< TrieNode > | removeWordHelper (const std::string &word, std::shared_ptr< TrieNode > curr, size_t index) |
+Static Private Member Functions | |
| static bool | hasChildren (std::shared_ptr< TrieNode > node) |
+Private Attributes | |
| +std::shared_ptr< TrieNode > | m_root |
+Static Private Attributes | |
| +static constexpr size_t | ALPHABETS = 26 |
A basic implementation of trie class to store only lower-case strings. You can extend the implementation to all the ASCII characters by changing the value of @ ALPHABETS to 128.
+
+
|
+ +inlinestaticprivate | +
Function to check if a node has some children which can form words.
| node | whose character array of pointers need to be checked for children. |
true if a child is found false if a child is not found
+
|
+ +inline | +
Insert a word into the trie.
| word | which needs to be inserted into the string. |
+
|
+ +inlineprivate | +
A recursive helper function to remove a word from the trie. First, it recursively traverses to the location of last character of word in the trie. However, if the word is not found, the function returns a runtime error. Upon successfully reaching the last character of word in trie, if sets the isEndOfWord to false and deletes the node if and only if it has no children, else it returns the current node.
| word | is the string which needs to be removed from trie. |
| curr | is the current node we are at. |
| index | is the index of the @word we are at. |
| a | runtime error in case @ word is not found in the trie. |
+
|
+ +inline | +
Search if a word is present in trie or not.
| word | which is needed to be searched in the trie. |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| + | Entry (int key=notPresent) |
| + | Entry (int key=notPresent) |
| + | Entry (int key=notPresent) |
+Public Attributes | |
| +int | key |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| +vector< vector< int > > | search_bridges (int n, const vector< vector< int >> &connections) |
+Private Member Functions | |
| +void | dfs (int current_node, int parent) |
+Private Attributes | |
| +vector< vector< int > > | graph |
| +vector< int > | in_time |
| +vector< int > | out_time |
| +int | timer |
| +vector< vector< int > > | bridge |
| +vector< bool > | visited |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for stack< Type >, including all inherited members.
+| clear() | stack< Type > | inline |
| display() | stack< Type > | inline |
| isEmptyStack() | stack< Type > | inline |
| operator=(const stack< Type > &otherStack) | stack< Type > | inline |
| pop() | stack< Type > | inline |
| push(Type item) | stack< Type > | inline |
| size (defined in stack< Type >) | stack< Type > | private |
| stack() | stack< Type > | inline |
| stackTop | stack< Type > | private |
| top() | stack< Type > | inline |
| ~stack() | stack< Type > | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
LU decomposition of a square matrix +More...
+#include <ctime>#include <iomanip>#include <iostream>#include <vector>+Functions | |
| int | lu_decomposition (const std::vector< std::vector< double >> &A, std::vector< std::vector< double >> *L, std::vector< std::vector< double >> *U) |
| template<typename T > | |
| std::ostream & | operator<< (std::ostream &out, std::vector< std::vector< T >> const &v) |
| int | main (int argc, char **argv) |
LU decomposition of a square matrix
+ +| int lu_decomposition | +( | +const std::vector< std::vector< double >> & | +A, | +
| + | + | std::vector< std::vector< double >> * | +L, | +
| + | + | std::vector< std::vector< double >> * | +U | +
| + | ) | ++ |
Perform LU decomposition on matrix
| [in] | A | matrix to decompose |
| [out] | L | output L matrix |
| [out] | U | output U matrix |
| int main | +( | +int | +argc, | +
| + | + | char ** | +argv | +
| + | ) | ++ |
Main function
+| std::ostream& operator<< | +( | +std::ostream & | +out, | +
| + | + | std::vector< std::vector< T >> const & | +v | +
| + | ) | ++ |
operator to print a matrix
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for double_linked_list, including all inherited members.
+| double_linked_list() (defined in double_linked_list) | double_linked_list | inline |
| insert(int x) (defined in double_linked_list) | double_linked_list | |
| remove(int x) (defined in double_linked_list) | double_linked_list | |
| reverseShow() (defined in double_linked_list) | double_linked_list | |
| search(int x) (defined in double_linked_list) | double_linked_list | |
| show() (defined in double_linked_list) | double_linked_list |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Private Member Functions | |
| +void | depth_first_search () |
| +void | explore (int, vector< bool > &) |
+Private Attributes | |
| +int | v |
| +list< int > * | adj |
| +vector< vector< int > > | adj |
| +int | connected_components |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for SegmentIntersection, including all inherited members.
+| direction(Point first_point, Point second_point, Point third_point) | SegmentIntersection | inline |
| intersect(Point first_point, Point second_point, Point third_point, Point forth_point) (defined in SegmentIntersection) | SegmentIntersection | inline |
| on_segment(Point first_point, Point second_point, Point third_point) | SegmentIntersection | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| + | lca (int n_) |
| +void | verify () |
| +void | build () |
| +void | dfs (int node, int par) |
| +int | query (int u, int v) |
+Public Attributes | |
| +int | n |
| +vector< int > | adj [N] |
| +int | up [LG][N] |
| +int | level [N] |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This Programme returns the Nth fibonacci as a string. +More...
+#include <iostream>#include <cstring>+Functions | |
| std::string | add (std::string a, std::string b) |
| void | fib_Accurate (uint64_t n) |
| int | main () |
This Programme returns the Nth fibonacci as a string.
+The method used is manual addition with carry and placing it in a string which is called string addition This makes it have no bounds or limits
+ +| std::string add | +( | +std::string | +a, | +
| + | + | std::string | +b | +
| + | ) | ++ |
function to add two string numbers
| [in] | a | first number in string to add |
| [in] | b | second number in string to add |
| void fib_Accurate | +( | +uint64_t | +n | ) | ++ |
Fibonacci iterator
| [in] | n | n^th Fibonacci number |
| int main | +( | +) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Attributes | |
| +std::shared_ptr< TrieNode > | character [ALPHABETS] {nullptr} |
| +bool | isEndOfWord {false} |
Structure of trie node. This struct doesn't need a constructor as we are initializing using intializer list which is more efficient than if we had done so with constructor.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m) +More...
+#include <iostream>#include <cstring>#include <vector>+Namespaces | |
| string_search | |
| String search algorithms. | |
+Functions | |
| std::vector< int > | string_search::getFailureArray (const std::string &pattern) |
| bool | string_search::kmp (const std::string &pattern, const std::string &text) |
| int | main () |
The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m)
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method. +More...
+#include <cassert>#include <cmath>#include <cstdlib>#include <ctime>#include <iostream>#include "./qr_decompose.h"+Namespaces | |
| qr_algorithm | |
| Functions to compute QR decomposition of any rectangular matrix. | |
+Macros | |
| #define | LIMS 9 |
+Functions | |
| void | create_matrix (std::valarray< std::valarray< double >> *A) |
| void | mat_mul (const std::valarray< std::valarray< double >> &A, const std::valarray< std::valarray< double >> &B, std::valarray< std::valarray< double >> *OUT) |
| std::valarray< double > | qr_algorithm::eigen_values (std::valarray< std::valarray< double >> *A, bool print_intermediates=false) |
| void | test1 () |
| void | test2 () |
| int | main (int argc, char **argv) |
Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.
+ +| #define LIMS 9 | +
limit of range of matrix values
+ +| void create_matrix | +( | +std::valarray< std::valarray< double >> * | +A | ) | ++ |
create a symmetric square matrix of given size with random elements. A symmetric square matrix will always have real eigen values.
+| [out] | A | matrix to create (must be pre-allocated in memory) |
| int main | +( | +int | +argc, | +
| + | + | char ** | +argv | +
| + | ) | ++ |
main function
+| void mat_mul | +( | +const std::valarray< std::valarray< double >> & | +A, | +
| + | + | const std::valarray< std::valarray< double >> & | +B, | +
| + | + | std::valarray< std::valarray< double >> * | +OUT | +
| + | ) | ++ |
Perform multiplication of two matrices.
| [in] | A | first matrix to multiply |
| [in] | B | second matrix to multiply |
| [out] | OUT | output matrix (must be pre-allocated) |
| void test1 | +( | +) | ++ |
test function to compute eigen values of a 2x2 matrix
+\[\begin{bmatrix} 5 & 7\\ 7 & 11 \end{bmatrix}\] +
+which are approximately, {15.56158, 0.384227}
+| void test2 | +( | +) | ++ |
test function to compute eigen values of a 2x2 matrix
+\[\begin{bmatrix} -4& 4& 2& 0& -3\\ 4& -4& 4& -3& -1\\ 2& 4& 4& 3& -3\\ 0& -3& 3& -1&-1\\ -3& -1& -3& -3& 0 \end{bmatrix}\] +
+which are approximately, {9.27648, -9.26948, 2.0181, -1.03516, -5.98994}
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Trie::TrieNode, including all inherited members.
+| character (defined in Trie::TrieNode) | Trie::TrieNode | |
| isEndOfWord (defined in Trie::TrieNode) | Trie::TrieNode |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral. +More...
+#include <cmath>#include <cstdio>#include <cstring>#include <iostream>+Functions | |
| std::string | fill (char c, int n) |
| std::string | tolowerRoman (int n) |
| std::string | toupperRoman (int n) |
| int | main () |
This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral.
+| std::string fill | +( | +char | +c, | +
| + | + | int | +n | +
| + | ) | ++ |
This functions fills a string with character c, n times and returns it
memcpy function. | int main | +( | +) | ++ |
main function
+| std::string tolowerRoman | +( | +int | +n | ) | ++ |
to convert to lowercase Roman Numeral the function works recursively
+| std::string toupperRoman | +( | +int | +n | ) | ++ |
to convert to uppercase Roman Numeral the function works recursively
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Trie, including all inherited members.
+| ALPHABETS (defined in Trie) | Trie | privatestatic |
| hasChildren(std::shared_ptr< TrieNode > node) | Trie | inlineprivatestatic |
| insert(const std::string &word) | Trie | inline |
| m_root (defined in Trie) | Trie | private |
| removeWord(const std::string &word) (defined in Trie) | Trie | inline |
| removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index) | Trie | inlineprivate |
| search(const std::string &word) | Trie | inline |
| Trie() | Trie | inline |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Queue_Array, including all inherited members.
+| arr (defined in Queue_Array) | Queue_Array | |
| dequeue() (defined in Queue_Array) | Queue_Array | |
| display() (defined in Queue_Array) | Queue_Array | |
| enqueue(int) (defined in Queue_Array) | Queue_Array | |
| front (defined in Queue_Array) | Queue_Array | private |
| Queue_Array() (defined in Queue_Array) | Queue_Array | inline |
| rear (defined in Queue_Array) | Queue_Array | private |
| size (defined in Queue_Array) | Queue_Array | private |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for list, including all inherited members.
+| BinarySearch(int *array, int first, int last, int x) (defined in list) | list | inline |
| data (defined in list) | list | |
| insert(int x) (defined in list) | list | inline |
| isSorted (defined in list) | list | |
| key | list | |
| LinarSearch(int *array, int x) (defined in list) | list | inline |
| next | list | |
| Remove(int x) (defined in list) | list | inline |
| Search(int x) (defined in list) | list | inline |
| Show() (defined in list) | list | inline |
| Sort() (defined in list) | list | inline |
| top (defined in list) | list |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Get list of prime numbers. +More...
+#include <iostream>#include <vector>+Functions | |
| std::vector< int > | primes (int max) |
| int | main () |
Get list of prime numbers.
+ +| int main | +( | +) | ++ |
main function
+| std::vector<int> primes | +( | +int | +max | ) | ++ |
Generate an increasingly large number of primes and store in a list
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for Edge, including all inherited members.
+| dest (defined in Edge) | Edge | |
| dst (defined in Edge) | Edge | |
| Edge()=delete (defined in Edge) | Edge | |
| Edge(Edge &&)=default (defined in Edge) | Edge | |
| Edge(Edge const &)=default (defined in Edge) | Edge | |
| Edge(unsigned int source, unsigned int destination) | Edge | inline |
| operator=(Edge &&)=default (defined in Edge) | Edge | |
| operator=(Edge const &)=default (defined in Edge) | Edge | |
| src (defined in Edge) | Edge | |
| src (defined in Edge) | Edge | |
| weight (defined in Edge) | Edge | |
| ~Edge()=default (defined in Edge) | Edge |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
A C++ program to demonstrate common Binary Heap Operations. +More...
+#include <climits>#include <iostream>#include <utility>+Classes | |
| class | MinHeap |
+Functions | |
| +int | main () |
A C++ program to demonstrate common Binary Heap Operations.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for large_number, including all inherited members.
+| _digits | large_number | private |
| add_digit(unsigned int value) | large_number | inline |
| digit_char(size_t i) const | large_number | inline |
| large_number() | large_number | inline |
| large_number(int n) | large_number | inlineexplicit |
| large_number(const large_number &a) | large_number | inline |
| large_number(std::vector< unsigned char > &vec) | large_number | inlineexplicit |
| large_number(char const *number_str) (defined in large_number) | large_number | inlineexplicit |
| multiply(const T n) | large_number | inlineprivate |
| num_digits() const | large_number | inline |
| operator!=(large_number const &a, large_number const &b) | large_number | friend |
| operator*=(const T n) | large_number | inline |
| operator+(const large_number &a, const T &b) | large_number | friend |
| operator++() | large_number | inline |
| operator++(int) | large_number | inline |
| operator+=(large_number n) | large_number | inline |
| operator+=(int n) (defined in large_number) | large_number | inline |
| operator<<(std::ostream &out, const large_number &a) | large_number | friend |
| operator=(const large_number &b) | large_number | inline |
| operator==(large_number const &a, large_number const &b) | large_number | friend |
| operator[](size_t n) | large_number | inline |
| operator[](size_t n) const (defined in large_number) | large_number | inline |
| test() | large_number | inlinestatic |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
C++ Program to find Binary Exponent Iteratively and Recursively. +More...
+#include <iostream>+Functions | |
| int | binExpo (int a, int b) |
| int | binExpo_alt (int a, int b) |
| int | main () |
| Main function. More... | |
C++ Program to find Binary Exponent Iteratively and Recursively.
+Calculate \(a^b\) in \(O(\log(b))\) by converting \(b\) to a binary number. Binary exponentiation is also known as exponentiation by squaring.
Example: 10 in base 2 is 1010.
+\begin{eqnarray*} 2^{10_d} &=& 2^{1010_b} = 2^8 * 2^2\\ 2^1 &=& 2\\ 2^2 &=& (2^1)^2 = 2^2 = 4\\ 2^4 &=& (2^2)^2 = 4^2 = 16\\ 2^8 &=& (2^4)^2 = 16^2 = 256\\ \end{eqnarray*} +
+Hence to calculate 2^10 we only need to multiply \(2^8\) and \(2^2\) skipping \(2^1\) and \(2^4\).
+| int binExpo | +( | +int | +a, | +
| + | + | int | +b | +
| + | ) | ++ |
| int binExpo_alt | +( | +int | +a, | +
| + | + | int | +b | +
| + | ) | ++ |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions. +More...
+#include <cmath>#include <ctime>#include <iostream>#include <limits>+Macros | |
| +#define | EPSILON 1e-6 |
| +#define | MAX_ITERATIONS 50000 |
| Maximum number of iterations to check. | |
+Functions | |
| static double | eq (double i) |
| static double | eq_der (double i) |
| int | main () |
Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions.
+The \((i+1)^\text{th}\) approximation is given by:
+\[ x_{i+1} = x_i - \frac{f(x_i)}{f'(x_i)} \] +
+ +
+
|
+ +static | +
define \(f(x)\) to find root for
+
+
|
+ +static | +
define the derivative function \(f'(x)\)
+| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations. +More...
++Functions | |
| large_number | fib (uint64_t n) |
| +int | main (int argc, char *argv[]) |
Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations.
+Took 0.608246 seconds to compute 50,000^th Fibonacci number that contains 10450 digits!
+ + +| large_number fib | +( | +uint64_t | +n | ) | ++ |
Compute fibonacci numbers using the relation
+\[f(n)=f(n-1)+f(n-2)\] +
+and returns the result as a large_number type.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Function to convert decimal number to binary representation. +More...
+#include <iostream>+Functions | |
| void | method1 (int number) |
| void | method2 (int number) |
| +int | main () |
Function to convert decimal number to binary representation.
+| void method1 | +( | +int | +number | ) | ++ |
This method converts the bit representation and stores it as a decimal number.
+| void method2 | +( | +int | +number | ) | ++ |
This method stores each bit value from LSB to MSB and then prints them back from MSB to LSB
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Public Member Functions | |
| + | Bit (vector< int > &arr) |
| + | Bit (int x) |
| +void | update (int id, int val) |
| +int | sum (int id) |
| +int | sum_range (int l, int r) |
+Private Member Functions | |
| +int | offset (int x) |
+Private Attributes | |
| +int | n |
| +vector< int > | bit |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Interpolation search algorithm +More...
+#include <iostream>+Functions | |
| int | InterpolationSearch (int A[], int n, int x) |
| int | main () |
Interpolation search algorithm
+| int InterpolationSearch | +( | +int | +A[], | +
| + | + | int | +n, | +
| + | + | int | +x | +
| + | ) | ++ |
function to search the value in an array using interpolation search
| [in] | arr | array to search in |
| [in] | value | value to search for |
| [in] | len | length of array |
| int main | +( | +) | ++ |
main function
+< passed array A inside the InterpolationSearch function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Method of successive approximations using fixed-point iteration method. +More...
+#include <cmath>#include <iostream>+Functions | |
| static float | eq (float y) |
| static float | eqd (float y) |
| int | main () |
Method of successive approximations using fixed-point iteration method.
+
+
|
+ +static | +
+
|
+ +static | +
| int main | +( | +) | ++ |
Main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Binary search algorithm +More...
+#include <iostream>+Functions | |
| int | binary_search (int a[], int r, int key) |
| int | main (int argc, char const *argv[]) |
| int binary_search | +( | +int | +a[], | +
| + | + | int | +r, | +
| + | + | int | +key | +
| + | ) | ++ |
binary_search function
| [in] | a | array to sort |
| [in] | r | right hand limit = \(n-1\) |
| [in] | key | value to find |
| int main | +( | +int | +argc, | +
| + | + | char const * | +argv[] | +
| + | ) | ++ |
main function
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This is the complete list of members for linkedlist, including all inherited members.
+| data (defined in linkedlist) | linkedlist | |
| next (defined in linkedlist) | linkedlist |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Compute powers of large numbers. +More...
+#include <iostream>+Macros | |
| #define | MAX 100000 |
+Functions | |
| int | multiply (int x, int res[], int res_size) |
| void | power (int x, int n) |
| int | main () |
Compute powers of large numbers.
+| #define MAX 100000 | +
Maximum number of digits in output \(x^n\) where \(1 <= x,\; n <= 10000\) and overflow may happen
+ +| int main | +( | +) | ++ |
| int multiply | +( | +int | +x, | +
| + | + | int | +res[], | +
| + | + | int | +res_size | +
| + | ) | ++ |
This function multiplies x with the number represented by res[]. res_size is size of res[] or number of digits in the number represented by res[]. This function uses simple school mathematics for multiplication. This function may value of res_size and returns the new value of res_size
| x | multiplicand |
| res | large number representation using array |
| res_size | number of digits in res |
| void power | +( | +int | +x, | +
| + | + | int | +n | +
| + | ) | ++ |
This function finds power of a number x and print \(x^n\)
| x | base |
| n | exponent |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | binary_search.cpp |
| Binary search algorithm | |
| file | exponential_search.cpp |
| Exponential search algorithm | |
| file | hash_search.cpp |
| Hash Search Algorithm - Best Time Complexity Ω(1) | |
| file | interpolation_search.cpp |
| Interpolation search algorithm | |
| file | interpolation_search2.cpp |
| Interpolation search algorithm | |
| file | jump_search.cpp |
| C++ program to implement Jump Search | |
| file | linear_search.cpp |
| Linear search algorithm | |
| file | median_search.cpp |
| Median search algorithm | |
| file | ternary_search.cpp |
| Ternary search algorithm | |
| file | text_search.cpp |
| Search for words in a long textual paragraph. | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | binary_exponent.cpp |
| C++ Program to find Binary Exponent Iteratively and Recursively. | |
| file | check_prime.cpp |
| Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime. | |
| file | double_factorial.cpp |
| Compute double factorial: \(n!!\). | |
| file | eulers_totient_function.cpp |
| C++ Program to find Euler's Totient function. | |
| file | extended_euclid_algorithm.cpp |
| GCD using extended Euclid's algorithm | |
| file | factorial.cpp |
| C++ program to find factorial of given number. | |
| file | fast_power.cpp |
| Faster computation for \(a^b\). | |
| file | fibonacci.cpp |
| Generate fibonacci sequence. | |
| file | fibonacci_fast.cpp |
| Faster computation of Fibonacci series. | |
| file | fibonacci_large.cpp |
| Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations. | |
| file | gcd_iterative_euclidean.cpp |
| Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm | |
| file | gcd_of_n_numbers.cpp |
| This program aims at calculating the GCD of n numbers by division method. | |
| file | gcd_recursive_euclidean.cpp |
| Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm | |
| file | large_factorial.cpp |
| Compute factorial of any arbitratily large number/. | |
| file | large_number.h [code] |
| Library to perform arithmatic operations on arbitrarily large numbers. | |
| file | least_common_multiple.cpp |
| file | modular_inverse_fermat_little_theorem.cpp |
| C++ Program to find the modular inverse using Fermat's Little Theorem | |
| file | number_of_positive_divisors.cpp |
| C++ Program to calculate number of divisors. | |
| file | power_for_huge_numbers.cpp |
| Compute powers of large numbers. | |
| file | prime_factorization.cpp |
| Prime factorization of positive integers. | |
| file | prime_numbers.cpp |
| Get list of prime numbers. | |
| file | primes_up_to_billion.cpp |
| Compute prime numbers upto 1 billion. | |
| file | realtime_stats.cpp |
| Compute statistics for data entered in rreal-time. | |
| file | sieve_of_eratosthenes.cpp |
| Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main). | |
| file | sqrt_double.cpp |
| Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding. | |
| file | string_fibonacci.cpp |
| This Programme returns the Nth fibonacci as a string. | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Directories |
+Files | |
| file | avltree.cpp |
| A simple tree implementation using nodes. | |
| file | binary_search_tree.cpp |
| A simple tree implementation using structured nodes. | |
| file | binaryheap.cpp |
| A C++ program to demonstrate common Binary Heap Operations. | |
| file | linkedlist_implentation_usingarray.cpp |
| Linked list implementation using Arrays. | |
| file | trie_modern.cpp |
| A basic implementation of trie class to store only lower-case strings. | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | adaline_learning.cpp |
| Adaptive Linear Neuron (ADALINE) implementation | |
| file | kohonen_som_topology.cpp |
| Kohonen self organizing map (topological map) | |
| file | kohonen_som_trace.cpp |
| Kohonen self organizing map (data tracing) | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | brute_force_string_searching.cpp |
| String pattern search - brute force. | |
| file | knuth_morris_pratt.cpp |
| The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m) | |
| file | rabin_karp.cpp |
| The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m) | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | addition_rule.cpp |
| Addition rule of probabilities. | |
| file | bayes_theorem.cpp |
| Bayes' theorem | |
| file | binomial_dist.cpp |
| Binomial distribution example | |
| file | poisson_dist.cpp |
| Poisson statistics | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | buzz_number.cpp |
| A buzz number is a number that is either divisible by 7 or has last digit as 7. | |
| file | decimal_to_binary.cpp |
| Function to convert decimal number to binary representation. | |
| file | decimal_to_hexadecimal.cpp |
| Convert decimal number to hexadecimal representation. | |
| file | decimal_to_roman_numeral.cpp |
| This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral. | |
| file | fast_interger_input.cpp |
Read integers from stdin continuously as they are entered without waiting for the \n character. | |
| file | happy_number.cpp |
| A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1. | |
| file | matrix_exponentiation.cpp |
| Matrix Exponentiation. | |
| file | palindrome_of_number.cpp |
| Check if a number is palindrome or not. | |
| file | paranthesis_matching.cpp |
| Perform paranthesis matching. | |
| file | pascal_triangle.cpp |
| Pascal's triangle implementation. | |
| file | primality_test.cpp |
| Primality test implementation. | |
| file | smallest_circle.cpp |
| Get centre and radius of the smallest circle that circumscribes given set of points. | |
| file | sparse_matrix.cpp |
| file | spiral_print.cpp |
| Print the elements of a matrix traversing it spirally. | |
| file | stairs_pattern.cpp |
| This program is use to print the following pattern. | |
| file | tower_of_hanoi.cpp |
| Solve the Tower of Hanoi problem. | |
| file | vector_important_functions.cpp |
| A C++ program to demonstrate working of std::sort(), std::reverse() | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | bisection_method.cpp |
| Solve the equation \(f(x)=0\) using bisection method | |
| file | durand_kerner_roots.cpp |
| Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm | |
| file | false_position.cpp |
| Solve the equation \(f(x)=0\) using false position method, also known as the Secant method. | |
| file | gaussian_elimination.cpp |
| Gaussian elimination method | |
| file | lu_decompose.cpp |
| LU decomposition of a square matrix | |
| file | newton_raphson_method.cpp |
| Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions. | |
| file | ode_forward_euler.cpp |
| Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method | |
| file | ode_midpoint_euler.cpp |
| Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method | |
| file | ode_semi_implicit_euler.cpp |
| Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method | |
| file | ordinary_least_squares_regressor.cpp |
| Linear regression example using Ordinary least squares | |
| file | qr_decompose.h [code] |
| Library functions to compute QR decomposition of a given matrix. | |
| file | qr_decomposition.cpp |
| Program to compute the QR decomposition of a given matrix. | |
| file | qr_eigen_values.cpp |
| Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method. | |
| file | successive_approximation.cpp |
| Method of successive approximations using fixed-point iteration method. | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | bubble_sort.cpp |
| Bubble sort algorithm. | |
| file | non_recursive_merge_sort.cpp |
| file | quick_sort.cpp |
| Quick sort algorithm. | |
| file | shell_sort2.cpp |
| Shell sort algorithm | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+Files | |
| file | line_segment_intersection.cpp |
| check whether two line segments intersect each other or not. | |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
| ▼ data_structures | |
| ► cll | |
| avltree.cpp | A simple tree implementation using nodes |
| binary_search_tree.cpp | A simple tree implementation using structured nodes |
| binaryheap.cpp | A C++ program to demonstrate common Binary Heap Operations |
| linkedlist_implentation_usingarray.cpp | Linked list implementation using Arrays |
| queue.h | |
| stack.h | |
| trie_modern.cpp | A basic implementation of trie class to store only lower-case strings |
| ▼ geometry | |
| line_segment_intersection.cpp | Check whether two line segments intersect each other or not |
| ▼ machine_learning | |
| adaline_learning.cpp | Adaptive Linear Neuron (ADALINE) implementation |
| kohonen_som_topology.cpp | Kohonen self organizing map (topological map) |
| kohonen_som_trace.cpp | Kohonen self organizing map (data tracing) |
| ▼ math | |
| binary_exponent.cpp | C++ Program to find Binary Exponent Iteratively and Recursively |
| check_prime.cpp | Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime |
| double_factorial.cpp | Compute double factorial: \(n!!\) |
| eulers_totient_function.cpp | C++ Program to find Euler's Totient function |
| extended_euclid_algorithm.cpp | GCD using extended Euclid's algorithm |
| factorial.cpp | C++ program to find factorial of given number |
| fast_power.cpp | Faster computation for \(a^b\) |
| fibonacci.cpp | Generate fibonacci sequence |
| fibonacci_fast.cpp | Faster computation of Fibonacci series |
| fibonacci_large.cpp | Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations |
| gcd_iterative_euclidean.cpp | Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm |
| gcd_of_n_numbers.cpp | This program aims at calculating the GCD of n numbers by division method |
| gcd_recursive_euclidean.cpp | Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm |
| large_factorial.cpp | Compute factorial of any arbitratily large number/ |
| large_number.h | Library to perform arithmatic operations on arbitrarily large numbers |
| least_common_multiple.cpp | |
| modular_inverse_fermat_little_theorem.cpp | C++ Program to find the modular inverse using Fermat's Little Theorem |
| number_of_positive_divisors.cpp | C++ Program to calculate number of divisors |
| power_for_huge_numbers.cpp | Compute powers of large numbers |
| prime_factorization.cpp | Prime factorization of positive integers |
| prime_numbers.cpp | Get list of prime numbers |
| primes_up_to_billion.cpp | Compute prime numbers upto 1 billion |
| realtime_stats.cpp | Compute statistics for data entered in rreal-time |
| sieve_of_eratosthenes.cpp | Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main) |
| sqrt_double.cpp | Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding |
| string_fibonacci.cpp | This Programme returns the Nth fibonacci as a string |
| ▼ numerical_methods | |
| bisection_method.cpp | Solve the equation \(f(x)=0\) using bisection method |
| durand_kerner_roots.cpp | Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm |
| false_position.cpp | Solve the equation \(f(x)=0\) using false position method, also known as the Secant method |
| gaussian_elimination.cpp | Gaussian elimination method |
| lu_decompose.cpp | LU decomposition of a square matrix |
| newton_raphson_method.cpp | Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions |
| ode_forward_euler.cpp | Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method |
| ode_midpoint_euler.cpp | Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method |
| ode_semi_implicit_euler.cpp | Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method |
| ordinary_least_squares_regressor.cpp | Linear regression example using Ordinary least squares |
| qr_decompose.h | Library functions to compute QR decomposition of a given matrix |
| qr_decomposition.cpp | Program to compute the QR decomposition of a given matrix |
| qr_eigen_values.cpp | Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method |
| successive_approximation.cpp | Method of successive approximations using fixed-point iteration method |
| ▼ others | |
| buzz_number.cpp | A buzz number is a number that is either divisible by 7 or has last digit as 7 |
| decimal_to_binary.cpp | Function to convert decimal number to binary representation |
| decimal_to_hexadecimal.cpp | Convert decimal number to hexadecimal representation |
| decimal_to_roman_numeral.cpp | This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral |
| fast_interger_input.cpp | Read integers from stdin continuously as they are entered without waiting for the \n character |
| happy_number.cpp | A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1 |
| matrix_exponentiation.cpp | Matrix Exponentiation |
| palindrome_of_number.cpp | Check if a number is palindrome or not |
| paranthesis_matching.cpp | Perform paranthesis matching |
| pascal_triangle.cpp | Pascal's triangle implementation |
| primality_test.cpp | Primality test implementation |
| smallest_circle.cpp | Get centre and radius of the smallest circle that circumscribes given set of points |
| sparse_matrix.cpp | |
| spiral_print.cpp | Print the elements of a matrix traversing it spirally |
| stairs_pattern.cpp | This program is use to print the following pattern |
| tower_of_hanoi.cpp | Solve the Tower of Hanoi problem |
| vector_important_functions.cpp | A C++ program to demonstrate working of std::sort(), std::reverse() |
| ▼ probability | |
| addition_rule.cpp | Addition rule of probabilities |
| bayes_theorem.cpp | Bayes' theorem |
| binomial_dist.cpp | Binomial distribution example |
| poisson_dist.cpp | Poisson statistics |
| ▼ search | |
| binary_search.cpp | Binary search algorithm |
| exponential_search.cpp | Exponential search algorithm |
| hash_search.cpp | Hash Search Algorithm - Best Time Complexity Ω(1) |
| interpolation_search.cpp | Interpolation search algorithm |
| interpolation_search2.cpp | Interpolation search algorithm |
| jump_search.cpp | C++ program to implement Jump Search |
| linear_search.cpp | Linear search algorithm |
| median_search.cpp | Median search algorithm |
| ternary_search.cpp | Ternary search algorithm |
| text_search.cpp | Search for words in a long textual paragraph |
| ▼ sorting | |
| bubble_sort.cpp | Bubble sort algorithm |
| non_recursive_merge_sort.cpp | |
| quick_sort.cpp | Quick sort algorithm |
| shell_sort2.cpp | Shell sort algorithm |
| ▼ strings | |
| brute_force_string_searching.cpp | String pattern search - brute force |
| knuth_morris_pratt.cpp | The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m) |
| rabin_karp.cpp | The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m) |
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
This page explains how to interpret the graphs that are generated by doxygen.
+Consider the following example:
This will result in the following graph:
+The boxes in the above graph have the following meaning:
+The arrows have the following meaning:
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Click on Files menu to see the list of all the files documented with the code.
+The implementations are for learning purpose. They may be less efficient than the implementation in the standard library.
+Read our Contribution Guidelines before you contribute.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+