MCPcopy Create free account

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

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

Functionmain
* @brief Main function * @returns 0 on exit */
math/modular_exponentiation.cpp:86
Functionmain
* @brief Main function * @returns 0 on exit */
math/sum_of_binomial_coefficient.cpp:64
Functionmain
* @brief Main function * @returns 0 on exit */
math/check_prime.cpp:81
Functionmain
Main function */
math/power_for_huge_numbers.cpp:82
Functionmain
math/fibonacci_large.cpp:38
Functionmain
* Main function */
math/gcd_iterative_euclidean.cpp:47
Functionmain
* @brief Main function * @returns 0 on exit */
math/eulers_totient_function.cpp:77
Functionmain
* @brief Main Function * @details Asks the user to enter the direction ratios for each of the two * mathematical vectors using std::cin * @returns
math/vector_cross_product.cpp:128
Functionmain
main function */
math/prime_numbers.cpp:34
Functionmain
* @brief Main function * @returns 0 on exit */
math/integral_approximation.cpp:133
Functionmain
main function */
math/sqrt_double.cpp:42
Functionmain
* @brief Main function * @param argc commandline argument count * @param argv commandline array of arguments * @returns 0 on exit */
math/eratosthenes.cpp:87
Functionmain
* @brief Main function * @returns 0 on exit */
math/volume.cpp:235
Functionmain
* Main Function */
math/sum_of_digits.cpp:68
Functionmain
* @brief Main function * @returns 0 on exit */
math/area.cpp:300
Functionmain
* @brief Main function * @returns 0 on exit */
math/factorial.cpp:57
Functionmain
* Main function */
math/fast_power.cpp:68
Functionmain
* @brief Main function * @returns 0 on exit */
math/approximate_pi.cpp:80
Functionmain
* @brief Main function * @returns 0 on exit */
math/check_amicable_pair.cpp:81
Functionmain
* Main function */
math/fibonacci_matrix_exponentiation.cpp:108
Functionmain
* Main function */
math/miller_rabin.cpp:183
Functionmain
* @brief Main function * @returns 0 on exit */
math/finding_number_of_digits_in_a_number.cpp:97
Functionmain
* @brief Main function * @returns 0 on exit */
math/inv_sqrt.cpp:87
Functionmain
* @brief Main function * @returns 0 on exit */
math/linear_recurrence_matrix.cpp:370
Functionmain
* Main function */
math/gcd_recursive_euclidean.cpp:42
Functionmain
* @brief Main function * @returns 0 on exit */
ciphers/a1z26_cipher.cpp:159
Functionmain
Main function */
ciphers/hill_cipher.cpp:532
Functionmain
* @brief Main function * @returns 0 on exit */
ciphers/morse_code.cpp:268
Functionmain
* @brief Main function * @returns 0 on exit */
ciphers/base64_encoding.cpp:197
Functionmain
* @brief Main function * @returns 0 on exit */
ciphers/atbash_cipher.cpp:81
Functionmain
* @brief Main function * @returns 0 on exit */
ciphers/elliptic_curve_key_exchange.cpp:320
Functionmain
Driver Code */
ciphers/xor_cipher.cpp:95
Functionmain
Driver Code */
ciphers/vigenere_cipher.cpp:131
Functionmain
Driver Code */
ciphers/caesar_cipher.cpp:120
Functionmain
* main function */
numerical_methods/qr_eigen_values.cpp:243
Functionmain
* @brief Main function * @param argc commandline argument count * @param argv commandline array of arguments * @returns 0 on exit */
numerical_methods/midpoint_integral_method.cpp:162
Functionmain
* Main Function */
numerical_methods/ode_midpoint_euler.cpp:192
Functionmain
Main function */
numerical_methods/newton_raphson_method.cpp:45
Functionmain
* @brief Main function * @param argc commandline argument count * @param argv commandline array of arguments * @returns 0 on exit */
numerical_methods/composite_simpson_rule.cpp:170
Functionmain
Main function */
numerical_methods/lu_decompose.cpp:84
Functionmain
* @brief Main function * @returns 0 on exit */
numerical_methods/false_position.cpp:102
Functionmain
* @brief Main Function * @return 0 on exit */
numerical_methods/gram_schmidt.cpp:248
Functionmain
Main function */
numerical_methods/successive_approximation.cpp:20
Functionmain
* Main Function */
numerical_methods/ode_forward_euler.cpp:189
Functionmain
* Main Function */
numerical_methods/ode_semi_implicit_euler.cpp:189
Functionmain
numerical_methods/inverse_fast_fourier_transform.cpp:155
Functionmain
* @brief Main function * @returns 0 on exit */
numerical_methods/rungekutta.cpp:130
Functionmain
* main function */
numerical_methods/qr_decomposition.cpp:23
Functionmain
Main function */
numerical_methods/gaussian_elimination.cpp:9
Functionmain
main function */
numerical_methods/bisection_method.cpp:37
Functionmain
Main function */
numerical_methods/golden_search_extrema.cpp:140
Functionmain
* Main function. * The comandline input arguments are taken as coeffiecients of a *polynomial. For example, this command * ```sh * ./durand_kerner
numerical_methods/durand_kerner_roots.cpp:284
Functionmain
Main function */
numerical_methods/brent_method_extrema.cpp:205
Functionmain
numerical_methods/fast_fourier_transform.cpp:161
Functionmain
numerical_methods/babylonian_method.cpp:94
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/house_robber.cpp:111
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/0_1_knapsack.cpp:126
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/longest_increasing_subsequence.cpp:79
Functionmain
this is main fuction
dynamic_programming/searching_of_element_in_dynamic_array.cpp:38
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/kadane.cpp:60
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/coin_change_topdown.cpp:91
Functionmain
dynamic_programming/tree_height.cpp:47
Functionmain
* @brief Main Function * @returns 0 on exit */
dynamic_programming/longest_palindromic_subsequence.cpp:97
Functionmain
dynamic_programming/longest_common_subsequence.cpp:61
Functionmain
Driver Function
dynamic_programming/floyd_warshall.cpp:90
Functionmain
dynamic_programming/catalan_numbers.cpp:79
Functionmain
* @brief Main function * @returns 0 on exit *******************************************************************************/
dynamic_programming/partition_problem.cpp:103
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/trapped_rainwater2.cpp:108
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/longest_common_string.cpp:156
Functionmain
* @brief main function * @return 0 on successful exit */
dynamic_programming/unbounded_0_1_knapsack.cpp:170
Functionmain
* @brief main function * @returns 0 on exit */
dynamic_programming/minimum_edit_distance.cpp:171
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/maximum_circular_subarray.cpp:84
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/abbreviation.cpp:192
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/palindrome_partitioning.cpp:128
Functionmain
Driver Function
dynamic_programming/bellman_ford.cpp:96
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/word_break.cpp:174
Functionmain
dynamic_programming/coin_change.cpp:37
Functionmain
Main function (driver code)*/
dynamic_programming/shortest_common_supersequence.cpp:164
Functionmain
main function
dynamic_programming/matrix_chain_multiplication.cpp:48
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/cut_rod.cpp:111
Functionmain
dynamic_programming/edit_distance.cpp:78
Functionmain
dynamic_programming/fibonacci_bottom_up.cpp:14
Functionmain
dynamic_programming/longest_increasing_subsequence_nlogn.cpp:32
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/armstrong_number_templated.cpp:90
Functionmain
dynamic_programming/egg_dropping_puzzle.cpp:42
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/subset_sum_dynamic.cpp:120
Functionmain
* @brief Main function * @returns 0 on exit */
dynamic_programming/trapped_rainwater.cpp:101
MethodmakeStrings
backtracking/generate_parentheses.cpp:45
Methodmake_recent
* @brief move the existing node in the list to the beginning of the list. * @param node_ptr node to be moved to the beginning. */
others/lru_cache2.cpp:99
Methodmat_mul
* @brief helper function to perform vector multiplication with encryption * or decryption matrix * * @param vector vector to multiply
ciphers/hill_cipher.cpp:160
FunctionmaxSubArray
dynamic_programming/kadane.cpp:42
Methodmean
return sample mean computed till last sample */
math/realtime_stats.cpp:86
FunctionmergeSort
sorting/merge_insertion_sort.cpp:107
Methodmid
* @brief Gives the midpoint between two integers * @param l The left endpoint * @param r The right endpoint * @return the middle poi
data_structures/segment_tree.cpp:51
Methodmodulo
ciphers/hill_cipher.cpp:315
Functionmycmp
range_queries/mo.cpp:25
MethodnewKid
* @brief Creating a new node with the same values of curr node * @param curr node that would be copied * @returns the new node */
range_queries/persistent_seg_tree_lazy_prop.cpp:66
Methodnew_val
Constructor * \param[in] x new data sample */
math/realtime_stats.cpp:77
Methodnode
operations_on_datastructures/selectionsortlinkedlist.cpp:9
MethodnumberOfChildren
* @brief Function to count the number of children a node in the trie has * @param node a trie node whose children need to be counted * @re
operations_on_datastructures/trie_multiple_search.cpp:72
← previousnext →1,801–1,900 of 2,100, ranked by callers