Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/TheAlgorithms/C-Plus-Plus
/ functions
Functions
2,100 in github.com/TheAlgorithms/C-Plus-Plus
⨍
Functions
2,100
◇
Types & classes
164
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
data_structures/sparse_table.cpp:129
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
data_structures/treap.cpp:229
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
data_structures/stack_using_queue.cpp:83
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
data_structures/list_array.cpp:218
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
data_structures/reverse_a_linked_list.cpp:228
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
data_structures/trie_using_hashmap.cpp:221
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
data_structures/stack_using_array.cpp:110
↓ 1 callers
Function
test
* @brief Testing function * @returns void */
data_structures/trie_tree.cpp:178
↓ 1 callers
Function
test
hashing/sha256.cpp:312
↓ 1 callers
Function
test
* @brief Self-test implementations of well-known SHA-1 hashes * @returns void */
hashing/sha1.cpp:221
↓ 1 callers
Function
test
* @brief Self-test implementations of well-known MD5 hashes * @returns void */
hashing/md5.cpp:298
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
graph/is_graph_bipartite2.cpp:100
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
graph/number_of_paths.cpp:86
↓ 1 callers
Function
test
* Function to test the above algorithm * @returns none */
graph/is_graph_bipartite.cpp:136
↓ 1 callers
Function
test
* @brief Self-test implementation * @returns void */
graph/topological_sort.cpp:126
↓ 1 callers
Function
test
* @brief Test Implementations * @returns void */
graph/connected_components_with_dsu.cpp:97
↓ 1 callers
Function
test
* @brief Function to test a simple search before and after deleting * an entry. And to test out the multiple variants of search. */
operations_on_datastructures/trie_multiple_search.cpp:425
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
operations_on_datastructures/inorder_successor_of_bst.cpp:387
↓ 1 callers
Function
test
* @brief Function to test the correctness of the Circular Linked List * @returns void */
operations_on_datastructures/circular_linked_list.cpp:333
↓ 1 callers
Function
test
* @brief Function to test the correctness of get_union() function * @returns void */
operations_on_datastructures/union_of_two_arrays.cpp:204
↓ 1 callers
Function
test
* @brief Function to test the correctness of shift_right() function * @returns void */
operations_on_datastructures/array_right_rotation.cpp:160
↓ 1 callers
Function
test
* @brief Function to test the correctness of shift_left() function * @returns void */
operations_on_datastructures/array_left_rotation.cpp:159
↓ 1 callers
Function
test
* @brief Function to test the correctness of the Tree Reversal */
operations_on_datastructures/reverse_binary_tree.cpp:260
↓ 1 callers
Function
test
* @brief Function to test the correctness of get_intersection() function * @returns void */
operations_on_datastructures/intersection_of_two_arrays.cpp:187
↓ 1 callers
Function
test
* Function for testing power function. * test cases and assert statement. * @returns `void` */
math/modular_division.cpp:89
↓ 1 callers
Function
test
* @brief Self-test implementations to test iterativeFactorial function. * @note There is 1 special case: 0! = 1. */
math/iterative_factorial.cpp:69
↓ 1 callers
Function
test
* @brief Function to test the Fibonacci computation * @returns void */
math/fibonacci_fast.cpp:63
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
math/n_choose_r.cpp:52
↓ 1 callers
Function
test
* Function for testing lcmSum function. * test cases and assert statement. * @returns `void` */
math/lcm_sum.cpp:66
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/power_of_two.cpp:59
↓ 1 callers
Function
test
* @brief Function for testing largestPower function. * test cases and assert statement. * @returns `void` */
math/largest_power.cpp:48
↓ 1 callers
Function
test
* @brief Self-test implementation * @return void */
math/gcd_of_n_numbers.cpp:87
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/integral_approximation2.cpp:133
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/aliquot_sum.cpp:57
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/armstrong_number.cpp:67
↓ 1 callers
Function
test
* @brief Self-test implementations to test quadraticEquation function. * @note There are 4 different types of solutions: Real and equal, real, * com
math/quadratic_equations_complex_numbers.cpp:122
↓ 1 callers
Function
test
* @brief Self-test implementation * @returns `void` */
math/fibonacci.cpp:49
↓ 1 callers
Function
test
* Function for testing fiboSum function. * test cases and assert statement. * @returns `void` */
math/fibonacci_sum.cpp:102
↓ 1 callers
Function
test
* @brief Self-test implementation * @return void */
math/modular_inverse_fermat_little_theorem.cpp:122
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/perimeter.cpp:120
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/n_bonacci.cpp:69
↓ 1 callers
Function
test
* @brief self-test implementations * @returns void */
math/modular_inverse_simple.cpp:37
↓ 1 callers
Function
test
* Function for testing power function. * test cases and assert statement. * @returns `void` */
math/modular_exponentiation.cpp:60
↓ 1 callers
Function
test
* Function for testing binomialCoeffSum function. * test cases and assert statement. * @returns `void` */
math/sum_of_binomial_coefficient.cpp:38
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/eulers_totient_function.cpp:61
↓ 1 callers
Function
test
* @brief test function. * @details test the cross() and the mag() functions. */
math/vector_cross_product.cpp:103
↓ 1 callers
Function
test
math/integral_approximation.cpp:75
↓ 1 callers
Function
test
* @brief Self-tests the sieve function for major inconsistencies * @returns void */
math/eratosthenes.cpp:64
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/volume.cpp:112
↓ 1 callers
Function
test
* Function for testing the sum_of_digits() with * all the test cases. */
math/sum_of_digits.cpp:58
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/area.cpp:130
↓ 1 callers
Function
test
* Function to test above algorithm */
math/fibonacci_matrix_exponentiation.cpp:91
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
math/inv_sqrt.cpp:68
↓ 1 callers
Function
test
* @brief Self test-implementations * @returns void */
math/linear_recurrence_matrix.cpp:193
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
ciphers/a1z26_cipher.cpp:120
↓ 1 callers
Function
test
* @brief Function to test above algorithm * @returns void */
ciphers/morse_code.cpp:245
↓ 1 callers
Function
test
* @brief Self test-implementations * @returns void */
ciphers/base64_encoding.cpp:156
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
ciphers/atbash_cipher.cpp:62
↓ 1 callers
Function
test
* @brief Function to test the * provided algorithm above * @returns void */
ciphers/elliptic_curve_key_exchange.cpp:267
↓ 1 callers
Function
test
* Function to test above algorithm */
ciphers/xor_cipher.cpp:75
↓ 1 callers
Function
test
* Function to test above algorithm */
ciphers/vigenere_cipher.cpp:111
↓ 1 callers
Function
test
* Function to test above algorithm */
ciphers/caesar_cipher.cpp:100
↓ 1 callers
Function
test
* @brief Self-test implementations * @param N is the number of intervals * @param h is the step * @param a is x0 * @param b is the end of the inte
numerical_methods/midpoint_integral_method.cpp:123
↓ 1 callers
Function
test
* \brief Self-test implementations * @param N is the number of intervals * @param h is the step * @param a is x0 * @param b is the end of the inte
numerical_methods/composite_simpson_rule.cpp:132
↓ 1 callers
Function
test
namespace numerical_methods * Test Function. Process has been tested for 3 Sample Inputs * @returns void */
numerical_methods/gram_schmidt.cpp:181
↓ 1 callers
Function
test
* @brief Self-test implementations * @details * Declaring two test cases and checking for the error * in predicted and true value is less than 0.00
numerical_methods/inverse_fast_fourier_transform.cpp:101
↓ 1 callers
Function
test
* @brief Tests to check algorithm implementation. * @returns void */
numerical_methods/rungekutta.cpp:100
↓ 1 callers
Function
test
* @brief Self-test implementations * @details * Declaring two test cases and checking for the error * in predicted and true value is less than 0
numerical_methods/fast_fourier_transform.cpp:105
↓ 1 callers
Function
test
* @brief Self-test implementations * @details * Declaring two test cases and checking for the error * in predicted and true value is less than 0
numerical_methods/babylonian_method.cpp:62
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
dynamic_programming/house_robber.cpp:66
↓ 1 callers
Function
test
* @brief Function to test the above algorithm * @returns void */
dynamic_programming/0_1_knapsack.cpp:96
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
dynamic_programming/longest_increasing_subsequence.cpp:64
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
dynamic_programming/coin_change_topdown.cpp:74
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
dynamic_programming/longest_palindromic_subsequence.cpp:86
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void *******************************************************************************/
dynamic_programming/partition_problem.cpp:89
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
dynamic_programming/trapped_rainwater2.cpp:69
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
dynamic_programming/minimum_edit_distance.cpp:142
↓ 1 callers
Function
test
* @brief Self-test implementation * @returns void */
dynamic_programming/maximum_circular_subarray.cpp:64
↓ 1 callers
Function
test
* @brief Self test-implementations * @returns void */
dynamic_programming/abbreviation.cpp:153
↓ 1 callers
Function
test
* @brief Test Function * @return void */
dynamic_programming/palindrome_partitioning.cpp:98
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
dynamic_programming/word_break.cpp:156
↓ 1 callers
Function
test
* Test Function * @return void */
dynamic_programming/shortest_common_supersequence.cpp:124
↓ 1 callers
Function
test
* @brief Function to test above algorithm * @returns void */
dynamic_programming/cut_rod.cpp:72
↓ 1 callers
Function
test
* @brief Test Function * @return void */
dynamic_programming/subset_sum_dynamic.cpp:82
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
dynamic_programming/trapped_rainwater.cpp:62
↓ 1 callers
Method
test
* Function to check implementation **/
math/large_number.h:65
↓ 1 callers
Function
test1
* test function to predict points in a 2D coordinate system above the line * \f$x=y\f$ as +1 and others as -1. * Note that each point is defined by
machine_learning/adaline_learning.cpp:224
↓ 1 callers
Function
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 patte
machine_learning/kohonen_som_topology.cpp:369
↓ 1 callers
Function
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. * Th
machine_learning/kohonen_som_trace.cpp:233
↓ 1 callers
Function
test1
* @brief Test the computed preorder with the actual preorder. * @param binaryTree instance of the BinaryTree class * @param root head/root node of
others/iterative_tree_traversals.cpp:210
↓ 1 callers
Function
test1
* @brief 1st test-case * @returns void */
others/recursive_tree_traversal.cpp:201
↓ 1 callers
Function
test1
* @brief Self-test implementation #1 * @returns void *******************************************************************************/
search/binary_search.cpp:92
↓ 1 callers
Function
test1
* @brief Function to test sorting algorithm * @returns void */
sorting/stooge_sort.cpp:47
↓ 1 callers
Function
test1
* @brief Self-test implementations, 1st test * @returns void */
data_structures/dsu_path_compression.cpp:170
↓ 1 callers
Function
test1
* @brief Self-implementations, 1st test * @returns void */
data_structures/dsu_union_rank.cpp:134
↓ 1 callers
Function
test1
@brief simple test to insert a given array and delete some item, and print * the tree*/
data_structures/tree_234.cpp:1263
↓ 1 callers
Function
test1
* this test is testing if ::hamilton_cycle returns `true` for * graph: `1 -> 2 -> 3 -> 4` * @return None */
graph/hamiltons_cycle.cpp:81
↓ 1 callers
Function
test1
* @brief A Test to check a single value * @returns void */
operations_on_datastructures/circular_linked_list.cpp:252
↓ 1 callers
Function
test1
* @brief A Test to check an edge case (two empty arrays) * @returns void */
operations_on_datastructures/union_of_two_arrays.cpp:104
↓ 1 callers
Function
test1
* @brief A Test to check an simple case * @returns void */
operations_on_datastructures/array_right_rotation.cpp:76
← previous
next →
1,001–1,100 of 2,100, ranked by callers