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
Method
search
* Search if a word is present in trie or not. * @param word which is needed to be searched in the trie. * @return True if the word is found
data_structures/trie_modern.cpp:132
↓ 1 callers
Method
search
data_structures/doubly_linked_list.cpp:65
↓ 1 callers
Method
search_bridges
graph/bridge_finding_with_tarjan_algorithm.cpp:36
↓ 1 callers
Function
searchingProber
Looks for a matching key * @param entry Instance of table entry * @param key key value to search/probe * @returns `true` if key matches the entry
hashing/quadratic_probing_hash_table.cpp:119
↓ 1 callers
Function
searchingProber
Looks for a matching key * @param entry vector to search in * @param key key value to search * @returns `true` if found * @returns `false` if not
hashing/double_hash_hash_table.cpp:133
↓ 1 callers
Function
searchingProber
Looks for a matching key * @param entry instance to check in * @param key key value to hash * @return hash value of the key */
hashing/linear_probing_hash_table.cpp:110
↓ 1 callers
Function
second_test
math/finding_number_of_digits_in_a_number.cpp:84
↓ 1 callers
Function
semi_implicit_euler
* @brief Compute approximation using the semi-implicit-Euler * method in the given limits. * @param[in] dx step size * @param[in] x0 initi
numerical_methods/ode_semi_implicit_euler.cpp:103
↓ 1 callers
Function
semi_implicit_euler_step
\addtogroup ode Ordinary Differential Equations * @{ */ * @brief Compute next step approximation using the semi-implicit-Euler * method. @f[y_{n+1}
numerical_methods/ode_semi_implicit_euler.cpp:82
↓ 1 callers
Method
set_graph
graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp:49
↓ 1 callers
Function
sha256
* @brief Computes the final hash value * @param input Input string * @return std::string The final hash value */
hashing/sha256.cpp:232
↓ 1 callers
Function
show
greedy_algorithms/prims_minimum_spanning_tree.cpp:52
↓ 1 callers
Function
show
* Utility function used to print the array after * sorting */
sorting/merge_sort.cpp:95
↓ 1 callers
Function
show
sorting/odd_even_sort.cpp:29
↓ 1 callers
Function
show
data_structures/stack_using_linked_list.cpp:28
↓ 1 callers
Function
show
data_structures/queue_using_linked_list.cpp:42
↓ 1 callers
Function
show
data_structures/queue_using_array2.cpp:30
↓ 1 callers
Function
show
operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp:42
↓ 1 callers
Function
show
operations_on_datastructures/circular_queue_using_array.cpp:32
↓ 1 callers
Method
show
data_structures/doubly_linked_list.cpp:81
↓ 1 callers
Function
show_pascal
* Print the triangle * \param [in] arr 2D-array containing Pascal numbers * \param [in] n depth of Pascal triangle to print */
others/pascal_triangle.cpp:18
↓ 1 callers
Function
solve
* @brief Solve the Magic Sequence problem * @param s working memory for the sequence * @param ret list of the valid magic sequences * @param depth
backtracking/magic_sequence.cpp:80
↓ 1 callers
Function
sphere_surface_area
math/area.cpp:97
↓ 1 callers
Function
sphere_volume
math/volume.cpp:91
↓ 1 callers
Function
spiralPrint
Traverse the matrix spirally and print the sequence of elements * \param [in] a matrix to read from * \param [in] r number of rows * \param [in] c
others/spiral_print.cpp:29
↓ 1 callers
Function
step_ith
* @brief Function to sort vector according to current digit using stable * sorting. * @param cur_digit - sort according to the cur_digit * @param a
sorting/radix_sort2.cpp:51
↓ 1 callers
Function
strand_sort
sorting/strand_sort.cpp:36
↓ 1 callers
Method
strassens_multiplication
divide_and_conquer/strassen_matrix_multiplication.cpp:340
↓ 1 callers
Function
subset_sum_problem
* Function implementing subset sum algorithm using top-down approach * @param arr input array * @param targetSum the target sum of the subset * @re
dynamic_programming/subset_sum_dynamic.cpp:70
↓ 1 callers
Function
subset_sum_recursion
* Recursive function using dynamic programming to find if the required sum * subset exists or not. * @param arr input array * @param targetSum the
dynamic_programming/subset_sum_dynamic.cpp:43
↓ 1 callers
Method
summary
* Function to print summary of the network. */
machine_learning/neural_network.cpp:773
↓ 1 callers
Function
ternary_search
* ternary_search is a template function * You could either use it_ternary_search or rec_ternary_search according to * preference. * \param [in] N l
search/ternary_search.cpp:127
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
machine_learning/k_nearest_neighbors.cpp:140
↓ 1 callers
Function
test
* Function to test neural network * @returns none */
machine_learning/neural_network.cpp:805
↓ 1 callers
Function
test
* @brief Self test-implementations * @returns void */
machine_learning/a_star_search.cpp:536
↓ 1 callers
Function
test
* @brief self test implementation * returns void */
strings/duval.cpp:77
↓ 1 callers
Function
test
* @brief Function with test cases for Horspool's algorithm * @returns void */
strings/horspool.cpp:100
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
strings/z_function.cpp:72
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
strings/manacher_algorithm.cpp:151
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
greedy_algorithms/kruskals_minimum_spanning_tree.cpp:64
↓ 1 callers
Function
test
* @brief Function to test the above algorithm * @returns void */
greedy_algorithms/jump_game.cpp:57
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
others/kadanes3.cpp:48
↓ 1 callers
Function
test
Test case: result should be: * \n Circle with * \n radius 3.318493136080724 * \n centre at (3.0454545454545454, 1.3181818181818181) */
others/smallest_circle.cpp:158
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
others/easter.cpp:85
↓ 1 callers
Function
test
* @brief self test implementations * @return void */
others/lru_cache2.cpp:220
↓ 1 callers
Function
test
* @brief self test implementation * @return void */
others/lfu_cache.cpp:250
↓ 1 callers
Function
test
* Test function * @returns void */
geometry/jarvis_algorithm.cpp:151
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void *******************************************************************************/
geometry/graham_scan_algorithm.cpp:51
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
bit_manipulation/travelling_salesman_using_bit_manipulation.cpp:100
↓ 1 callers
Function
test
* @brief Self-test implementation * * @returns void */
bit_manipulation/gray_code.cpp:58
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
bit_manipulation/set_kth_bit.cpp:61
↓ 1 callers
Function
test
* @brief Function to the test hamming distance. * @returns void */
bit_manipulation/hamming_distance.cpp:76
↓ 1 callers
Function
test
bit_manipulation/count_of_set_bits.cpp:65
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp:60
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
bit_manipulation/power_of_2.cpp:49
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
bit_manipulation/check_even_odd.cpp:66
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
bit_manipulation/count_bits_flip.cpp:65
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
bit_manipulation/find_non_repeating_number.cpp:62
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp:74
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
search/text_search.cpp:34
↓ 1 callers
Function
test
* Function to test above algorithm */
search/median_search.cpp:107
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
search/saddleback_search.cpp:78
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
search/floyd_cycle_detection_algo.cpp:64
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
search/sublist_search.cpp:349
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
search/median_search2.cpp:90
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
range_queries/prefix_sum_array.cpp:63
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
range_queries/persistent_seg_tree_lazy_prop.cpp:269
↓ 1 callers
Function
test
* @brief Self-test implementation * * @returns void */
range_queries/segtree.cpp:147
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
physics/ground_to_ground_projectile_motion.cpp:88
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
divide_and_conquer/strassen_matrix_multiplication.cpp:427
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp:150
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
probability/exponential_dist.cpp:72
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
probability/geometric_dist.cpp:197
↓ 1 callers
Function
test
* Test function * @returns void */
sorting/wiggle_sort.cpp:107
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
sorting/pancake_sort.cpp:86
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
sorting/dnf_sort.cpp:74
↓ 1 callers
Function
test
* @brief Function for testing * @return N/A */
sorting/strand_sort.cpp:64
↓ 1 callers
Function
test
* * @} * Test cases to test the program * */
sorting/heap_sort.cpp:99
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
sorting/cycle_sort.cpp:92
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
sorting/selection_sort_recursive.cpp:95
↓ 1 callers
Function
test
* Function to test above algorithm */
sorting/bogo_sort.cpp:81
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
sorting/random_pivot_quick_sort.cpp:312
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
sorting/recursive_bubble_sort.cpp:104
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
sorting/wave_sort.cpp:53
↓ 1 callers
Function
test
* @brief Self-test implementation * @return void */
sorting/bubble_sort.cpp:96
↓ 1 callers
Function
test
* Test function */
sorting/gnome_sort.cpp:85
↓ 1 callers
Function
test
* @brief Function to test code using random arrays * @returns none */
sorting/merge_insertion_sort.cpp:132
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
sorting/count_inversions.cpp:194
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void *******************************************************************************/
sorting/selection_sort_iterative.cpp:76
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
sorting/binary_insertion_sort.cpp:104
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
backtracking/wildcard_matching.cpp:102
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
backtracking/magic_sequence.cpp:102
↓ 1 callers
Function
test
* @brief Test implementations * @returns void */
backtracking/subset_sum.cpp:58
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
backtracking/subarray_sum.cpp:68
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
backtracking/rat_maze.cpp:86
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
backtracking/generate_parentheses.cpp:82
↓ 1 callers
Function
test
* @brief Test function to save resulting points to a CSV file. * */
graphics/spirograph.cpp:93
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp:267
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
cpu_scheduling_algorithms/fcfs_scheduling.cpp:257
↓ 1 callers
Function
test
* @brief Self-test implementations * @returns void */
data_structures/segment_tree.cpp:112
← previous
next →
901–1,000 of 2,100, ranked by callers