Functions — github.com/TheAlgorithms/C-Plus-Plus

CodeHub 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

* @brief Main function * Creates a stack and pushed some value into it. * Through a series of push and pop functions on stack, * it demostrates the

data_structures/stack_using_queue.cpp:116

* Main function: * Allows the user add and delete values from the list. * Also allows user to search for and display values in the list. * @returns

data_structures/linked_list.cpp:222

Main function */

data_structures/disjoint_set.cpp:93

data_structures/binary_search_tree.cpp:125

* @brief Main function * @returns 0 on exit * */

data_structures/dsu_path_compression.cpp:206

* @brief Main function * @returns 0 on exit */

data_structures/list_array.cpp:260

Driver program to test above functions

data_structures/binaryheap.cpp:128

* @brief Main function * @returns 0 on exit */

data_structures/reverse_a_linked_list.cpp:301

data_structures/queue_using_linked_list.cpp:50

* @brief Main function * @returns 0 on exit */

data_structures/trie_using_hashmap.cpp:342

* Main function */

data_structures/trie_modern.cpp:160

data_structures/tree.cpp:74

data_structures/test_stack.cpp:182

data_structures/morrisinorder.cpp:92

* @brief Main function * @returns 0 on exit */

data_structures/dsu_union_rank.cpp:183

* @brief Main function * @param argc commandline argument count * @param argv commandline array of arguments * @returns 0 on exit */

data_structures/tree_234.cpp:1298

* @brief Main function * @returns 0 on exit */

data_structures/stack_using_array.cpp:175

data_structures/doubly_linked_list.cpp:100

* @brief Main function * @returns 0 on exit */

data_structures/bloom_filter.cpp:282

data_structures/queue_using_array2.cpp:36

* @brief Main function * @details * Allows the user to add and delete values from the queue. * Also allows user to display values in the queue. *

data_structures/queue_using_array.cpp:112

* @brief Main function * @return 0 on exit */

data_structures/trie_tree.cpp:205

data_structures/test_stack_students.cpp:20

data_structures/cll/main_cll.cpp:4

* @brief Main function * @returns 0 on exit */

hashing/sha256.cpp:326

Main function * @returns None */

hashing/quadratic_probing_hash_table.cpp:246

* @brief Main function * @returns 0 on exit */

hashing/sha1.cpp:300

Main program * @returns 0 on success */

hashing/double_hash_hash_table.cpp:250

Main function * @returns `0` always */

hashing/chaining.cpp:133

* @brief Main function * @returns 0 on exit */

hashing/md5.cpp:377

Main function * @returns 0 on success */

hashing/linear_probing_hash_table.cpp:224

Main function */

graph/breadth_first_search.cpp:185

* Main function */

graph/bridge_finding_with_tarjan_algorithm.cpp:55

* @brief Main function * @returns 0 on exit */

graph/bidirectional_dijkstra.cpp:249

* Main function. */

graph/cycle_check_directed_graph.cpp:305

Main function */

graph/connected_components.cpp:127

* @brief Main function * Instantitates a dummy graph of a small size with * a few edges between random nodes. * On applying the algorithm, it check

graph/is_graph_bipartite2.cpp:123

All critical/corner cases have been taken care of. Input your required values: (not hardcoded)

graph/kosaraju.cpp:111

* @brief Main function * @returns 0 on exit */

graph/travelling_salesman_problem.cpp:105

Main function */

graph/depth_first_search.cpp:109

* @brief Main function * @returns 0 on exit */

graph/depth_first_search_with_stack.cpp:173

graph/kruskal.cpp:46

* @brief Main function * @returns 0 on exit */

graph/number_of_paths.cpp:148

* Main function */

graph/is_graph_bipartite.cpp:168

graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp:102

* @brief Main function * @returns 0 on exit */

graph/topological_sort.cpp:186

* @brief Main function * @returns 0 on exit */

graph/hopcroft_karp.cpp:306

graph/topological_sort_by_kahns_algo.cpp:9

* Main function * */

graph/hamiltons_cycle.cpp:140

Main function */

graph/lowest_common_ancestor.cpp:255

* @brief Main function * @returns 0 on exit */

graph/connected_components_with_dsu.cpp:117

Main function */

graph/dijkstra.cpp:152

graph/prim.cpp:36

* @brief Main function * @returns 0 on exit */

operations_on_datastructures/trie_multiple_search.cpp:464

* @brief Main function * @returns 0 on exit */

operations_on_datastructures/inorder_successor_of_bst.cpp:396

* @brief main function * @returns 0 on exit */

operations_on_datastructures/circular_linked_list.cpp:345

operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp:50

* @brief main function * @returns 0 on exit */

operations_on_datastructures/union_of_two_arrays.cpp:217

operations_on_datastructures/selectionsortlinkedlist.cpp:157

* @brief main function * @returns 0 on exit */

operations_on_datastructures/array_right_rotation.cpp:172

* @brief main function * @returns 0 on exit */

operations_on_datastructures/array_left_rotation.cpp:171

* @brief main function * @returns 0 on exit */

operations_on_datastructures/reverse_binary_tree.cpp:270

* @brief main function * @returns 0 on exit */

operations_on_datastructures/intersection_of_two_arrays.cpp:200

operations_on_datastructures/get_size_of_linked_list.cpp:33

operations_on_datastructures/circular_queue_using_array.cpp:38

* Main function */

math/double_factorial.cpp:68

math/binary_exponent.cpp:55

* @brief Main function * @returns 0 on exit */

math/magic_number.cpp:78

* @brief Main function * @returns 0 on exit */

math/modular_division.cpp:111

main function */

math/string_fibonacci.cpp:82

* @brief Main function * @returns 0 on exit */

math/iterative_factorial.cpp:120

* Main function */

math/complex_numbers.cpp:268

* @brief Main Function * @returns 0 on exit */

math/fibonacci_fast.cpp:175

* @brief Main function * @returns 0 on exit */

math/sieve_of_eratosthenes.cpp:119

* @brief Main function * @returns 0 on exit */

math/check_factorial.cpp:71

* @brief Main function to run tests * @returns 0 on program success */

math/factorial_memoization.cpp:61

* @brief Main function * @param argc commandline argument count * @param argv commandline array of arguments * @returns 0 on exit */

math/binomial_calculate.cpp:79

* @brief Main function * @returns 0 on exit */

math/n_choose_r.cpp:78

* @brief Main function * @returns 0 on exit */

math/lcm_sum.cpp:97

* @brief Main function * @returns 0 on exit */

math/power_of_two.cpp:99

* @brief Main function * @returns 0 on exit */

math/largest_power.cpp:74

* @brief Main function * @return 0 on exit */

math/gcd_of_n_numbers.cpp:111

* Main function */

math/least_common_multiple.cpp:78

* @brief Main function * @returns 0 on exit */

math/integral_approximation2.cpp:215

* @brief Main function * @returns 0 on exit */

math/aliquot_sum.cpp:74

* Main program **/

math/large_factorial.cpp:89

math/extended_euclid_algorithm.cpp:88

* @brief Main Function * @returns 0 on exit */

math/armstrong_number.cpp:88

* @brief Main function * @returns 0 on exit */

math/quadratic_equations_complex_numbers.cpp:186

* Main function */

math/number_of_positive_divisors.cpp:80

Main program */

math/prime_factorization.cpp:62

math/ncr_modulo_p.cpp:191

* @brief Main function * @returns 0 on exit */

math/fibonacci.cpp:64

* @brief Main function * @returns 0 on exit */

math/fibonacci_sum.cpp:137

* @brief Main function * @return 0 on exit */

math/modular_inverse_fermat_little_theorem.cpp:137

* @brief Main function * @returns 0 on exit */

math/perimeter.cpp:284

Main function */

math/primes_up_to_billion.cpp:26

* @brief Main function * @returns 0 on exit */

math/n_bonacci.cpp:104

* @brief Main function * @returns 0 on exit */

math/modular_inverse_simple.cpp:59

Main function */

math/realtime_stats.cpp:158

← previous next →1,701–1,800 of 2,100, ranked by callers