MCPcopy Create free account

hub / github.com/TheAlgorithms/C-Plus-Plus / functions

Functions2,100 in github.com/TheAlgorithms/C-Plus-Plus

⨍ Functions 2,100◇ Types & classes 164
↓ 1 callersFunctiontest_assignment_operator
data_structures/reverse_a_linked_list.cpp:274
↓ 1 callersFunctiontest_bitset
* @brief Test for bitset * * @returns void */
data_structures/bloom_filter.cpp:267
↓ 1 callersFunctiontest_bloom_filter_int
* @brief Test for bloom filter with int as generic type * @returns void */
data_structures/bloom_filter.cpp:246
↓ 1 callersFunctiontest_bloom_filter_string
* @brief Test for bloom filter with string as generic type * @returns void */
data_structures/bloom_filter.cpp:226
↓ 1 callersFunctiontest_catalan_numbers_25
dynamic_programming/catalan_numbers.cpp:73
↓ 1 callersFunctiontest_catalan_numbers_up_to_20
dynamic_programming/catalan_numbers.cpp:47
↓ 1 callersFunctiontest_circle
Creates a random set of points distributed *near* the circumference * of a circle and trains an SOM that finds that circular pattern. The * generati
machine_learning/kohonen_som_trace.cpp:196
↓ 1 callersFunctiontest_compute_padded_size
* @brief Self-test implementations * @returns void */
hashing/sha256.cpp:248
↓ 1 callersFunctiontest_contains
* @brief Function for testing contains(). * * @returns `void` */
data_structures/binary_search_tree2.cpp:429
↓ 1 callersFunctiontest_copy_constructor
data_structures/reverse_a_linked_list.cpp:252
↓ 1 callersFunctiontest_double
Test function for double type arrays */
sorting/quick_sort_3.cpp:160
↓ 1 callersFunctiontest_extract_byte
hashing/sha256.cpp:254
↓ 1 callersFunctiontest_find_max
* @brief Function for testing find_max(). * * @returns `void` */
data_structures/binary_search_tree2.cpp:475
↓ 1 callersFunctiontest_find_min
* @brief Function for testing find_min(). * * @returns `void` */
data_structures/binary_search_tree2.cpp:452
↓ 1 callersFunctiontest_function
Test the algorithm implementation * \param[in] test_data array of data to test the algorithms */
math/realtime_stats.cpp:118
↓ 1 callersFunctiontest_function_1
* @brief Test function 1 with input array * {'2', '3', '1', '*', '+', '9', '-'} * @returns none */
others/postfix_evaluation.cpp:126
↓ 1 callersFunctiontest_function_2
* @brief Test function 2 with input array * {'100', '200', '+', '2', '/', '5', '*', '7', '+'} * @returns none */
others/postfix_evaluation.cpp:139
↓ 1 callersFunctiontest_function_3
others/postfix_evaluation.cpp:147
↓ 1 callersFunctiontest_get_char
hashing/sha256.cpp:266
↓ 1 callersFunctiontest_get_elements_inorder
* @brief Function for testing get_elements_inorder(). * * @returns `void` */
data_structures/binary_search_tree2.cpp:498
↓ 1 callersFunctiontest_get_elements_postorder
* @brief Function for testing get_elements_postorder(). * * @returns `void` */
data_structures/binary_search_tree2.cpp:540
↓ 1 callersFunctiontest_get_elements_preorder
* @brief Function for testing get_elements_preorder(). * * @returns `void` */
data_structures/binary_search_tree2.cpp:519
↓ 1 callersFunctiontest_insert
* @brief Function for testing insert(). * * @returns `void` */
data_structures/binary_search_tree2.cpp:358
↓ 1 callersFunctiontest_int
Test function for integer type arrays */
sorting/quick_sort_3.cpp:138
↓ 1 callersFunctiontest_lamniscate
Creates a random set of points distributed *near* the locus * of the [Lamniscate of * Gerono](https://en.wikipedia.org/wiki/Lemniscate_of_Gerono).
machine_learning/kohonen_som_trace.cpp:277
↓ 1 callersFunctiontest_longest_common_string_length
dynamic_programming/longest_common_string.cpp:91
↓ 1 callersFunctiontest_longest_common_string_length_for_reversed_inputs
dynamic_programming/longest_common_string.cpp:130
↓ 1 callersFunctiontest_longest_common_string_length_is_symmetric
dynamic_programming/longest_common_string.cpp:105
↓ 1 callersFunctiontest_not_enough_operands
others/postfix_evaluation.cpp:165
↓ 1 callersFunctiontest_not_enough_operands_empty_input
others/postfix_evaluation.cpp:176
↓ 1 callersFunctiontest_remove
* @brief Function for testing remove(). * * @returns `void` */
data_structures/binary_search_tree2.cpp:392
↓ 1 callersFunctiontest_right_rotate
hashing/sha256.cpp:280
↓ 1 callersFunctiontest_sha256
hashing/sha256.cpp:286
↓ 1 callersFunctiontest_single_input
others/postfix_evaluation.cpp:158
↓ 1 callersFunctiontest_too_many_operands
others/postfix_evaluation.cpp:187
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
strings/boyer_moore.cpp:250
↓ 1 callersFunctiontests
* @brief self-test implementations * @returns void */
strings/knuth_morris_pratt.cpp:79
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
greedy_algorithms/dijkstra_greedy.cpp:160
↓ 1 callersFunctiontests
* @brief run self test implementation. * @returns void */
greedy_algorithms/binary_addition.cpp:86
↓ 1 callersFunctiontests
* @brief self test implementation * @return void */
greedy_algorithms/digit_separation.cpp:83
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
greedy_algorithms/boruvkas_minimum_spanning_tree.cpp:196
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
greedy_algorithms/gale_shapley.cpp:114
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
others/kelvin_to_celsius.cpp:62
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
others/longest_substring_without_repeating_characters.cpp:92
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
others/recursive_tree_traversal.cpp:386
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
search/linear_search.cpp:37
↓ 1 callersFunctiontests
* @brief Test cases for Longest Increasing Subsequence function * @returns void */
search/longest_increasing_subsequence_using_binary_search.cpp:85
↓ 1 callersFunctiontests
* @brief Self-test implementation * @returns void *******************************************************************************/
search/interpolation_search.cpp:101
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
range_queries/fenwick_tree.cpp:114
↓ 1 callersFunctiontests
namespace sorting * @brief Self-test implementations * @returns void */
sorting/quick_sort_iterative.cpp:94
↓ 1 callersFunctiontests
* @brief self-test implementation * @returns void */
sorting/tim_sort.cpp:98
↓ 1 callersFunctiontests
* @brief self test implementation * @return void */
sorting/insertion_sort_recursive.cpp:105
↓ 1 callersFunctiontests
* @brief Function to test the above algorithm * @returns none */
sorting/radix_sort2.cpp:104
↓ 1 callersFunctiontests
Test Cases to test algorithm */
sorting/insertion_sort.cpp:109
↓ 1 callersFunctiontests
sorting/comb_sort.cpp:73
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
sorting/quick_sort.cpp:147
↓ 1 callersFunctiontests
Test function */
graph/breadth_first_search.cpp:138
↓ 1 callersFunctiontests
* @brief Function to test the * provided algorithm above * @returns void */
graph/bidirectional_dijkstra.cpp:200
↓ 1 callersFunctiontests
Function to test the algorithm */
graph/connected_components.cpp:93
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
graph/travelling_salesman_problem.cpp:78
↓ 1 callersFunctiontests
* Self-test implementations * @returns none */
graph/depth_first_search_with_stack.cpp:123
↓ 1 callersFunctiontests
* Self-test implementation * @returns none */
graph/hopcroft_karp.cpp:255
↓ 1 callersFunctiontests
* Unit tests * @returns none */
graph/lowest_common_ancestor.cpp:234
↓ 1 callersFunctiontests
Function to test the Algorithm */
graph/dijkstra.cpp:113
↓ 1 callersFunctiontests
* Test implementations */
math/double_factorial.cpp:51
↓ 1 callersFunctiontests
* @brief Test function * @returns void */
math/magic_number.cpp:52
↓ 1 callersFunctiontests
* Tests Function */
math/complex_numbers.cpp:206
↓ 1 callersFunctiontests
* @brief Self-test implementations * @return void */
math/sieve_of_eratosthenes.cpp:81
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
math/check_factorial.cpp:56
↓ 1 callersFunctiontests
* @brief Test implementations * @returns void */
math/binomial_calculate.cpp:56
↓ 1 callersFunctiontests
* Function for testing the lcm() functions with some assert statements. */
math/least_common_multiple.cpp:50
↓ 1 callersFunctiontests
* Test implementations */
math/number_of_positive_divisors.cpp:69
↓ 1 callersFunctiontests
* @brief tests math::ncr_modulo_p::NCRModuloP */
math/ncr_modulo_p.cpp:142
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
math/check_prime.cpp:62
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
math/factorial.cpp:44
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
math/approximate_pi.cpp:62
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
math/check_amicable_pair.cpp:67
↓ 1 callersFunctiontests
* Functions for testing the miller_rabin_primality_test() function with some * assert statements. */
math/miller_rabin.cpp:157
↓ 1 callersFunctiontests
* @brief runs all tests for ::longest_common_string_length funcion */
dynamic_programming/longest_common_string.cpp:142
↓ 1 callersFunctiontests
* @brief self test implementation * @return void */
dynamic_programming/unbounded_0_1_knapsack.cpp:111
↓ 1 callersFunctiontests
* @brief Self-test implementations * @returns void */
dynamic_programming/armstrong_number_templated.cpp:71
↓ 1 callersFunctiontime_of_flight
physics/ground_to_ground_projectile_motion.cpp:52
↓ 1 callersFunctiontoLittleEndian32
* @brief Sets 32-bit integer to little-endian if needed * @param n Number to set to little-endian (uint32_t) * @return uint32_t param n with binary
hashing/md5.cpp:90
↓ 1 callersFunctiontoLittleEndian64
* @brief Sets 64-bit integer to little-endian if needed * @param n Number to set to little-endian (uint64_t) * @return uint64_t param n with binary
hashing/md5.cpp:103
↓ 1 callersMethodto_string
* @brief Convert the hash to a hexadecimal string * @return std::string Final hash value */
hashing/sha256.cpp:130
↓ 1 callersFunctiontolowerRoman
to convert to lowercase Roman Numeral * the function works recursively */
others/decimal_to_roman_numeral.cpp:24
↓ 1 callersFunctiontopoSortKahn
graph/topological_sort_by_kahns_algo.cpp:35
↓ 1 callersFunctiontoupperRoman
to convert to uppercase Roman Numeral * the function works recursively */
others/decimal_to_roman_numeral.cpp:58
↓ 1 callersFunctiontriangle_area
math/area.cpp:52
↓ 1 callersFunctiontriangle_perimeter
math/perimeter.cpp:52
↓ 1 callersFunctiontriangle_prism_volume
math/volume.cpp:67
↓ 1 callersFunctionuint128_t_tests
* @brief Function to test the * uint128_t header * @returns void */
ciphers/elliptic_curve_key_exchange.cpp:197
↓ 1 callersFunctionuint256_t_tests
* @brief Function to test the * uint256_t header * @returns void */
ciphers/elliptic_curve_key_exchange.cpp:230
↓ 1 callersFunctionuniform_random_initialization
machine_learning/vector_ops.hpp:166
↓ 1 callersFunctionunion_sets
* @brief Merge 2 components to become one * @param node1 1st component * @param node2 2nd component * @returns void */
graph/connected_components_with_dsu.cpp:67
↓ 1 callersFunctionunit_matrix_initialization
machine_learning/vector_ops.hpp:193
↓ 1 callersMethodupdate
range_queries/fenwick_tree.cpp:75
↓ 1 callersMethodupdate
* @brief Updates the hash array * @param blocks Message schedule array * @return void */
hashing/sha256.cpp:67
↓ 1 callersFunctionupdateNear
greedy_algorithms/prims_minimum_spanning_tree.cpp:27
↓ 1 callersFunctionupdate_weights
* Update weights of the SOM using Kohonen algorithm * * \param[in] X data point - N features * \param[in,out] W weights matrix - PxQxN * \param[in
machine_learning/kohonen_som_topology.cpp:200
← previousnext →1,201–1,300 of 2,100, ranked by callers