Algorithm
- The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached. diff --git a/d3/d4c/sha1_8cpp__incl.map b/d3/d4c/sha1_8cpp__incl.map new file mode 100644 index 000000000..86f2e7568 --- /dev/null +++ b/d3/d4c/sha1_8cpp__incl.map @@ -0,0 +1,10 @@ + diff --git a/d3/d4c/sha1_8cpp__incl.md5 b/d3/d4c/sha1_8cpp__incl.md5 new file mode 100644 index 000000000..59cc1fdbc --- /dev/null +++ b/d3/d4c/sha1_8cpp__incl.md5 @@ -0,0 +1 @@ +4e343e8c96c1ec58395bca292ebb5bb7 \ No newline at end of file diff --git a/d3/d4c/sha1_8cpp__incl.svg b/d3/d4c/sha1_8cpp__incl.svg new file mode 100644 index 000000000..f881934c3 --- /dev/null +++ b/d3/d4c/sha1_8cpp__incl.svg @@ -0,0 +1,127 @@ + + + + + diff --git a/d3/db3/lru__cache_8cpp.html b/d3/db3/lru__cache_8cpp.html index edd7916d2..6b4109713 100644 --- a/d3/db3/lru__cache_8cpp.html +++ b/d3/db3/lru__cache_8cpp.html @@ -150,7 +150,7 @@ Functions
- Discards the least recently used items first. @@ -158,7 +158,7 @@ Logic
- General implementations of this technique require keeping "age bits" for cache-lines and track the "Least Recently Used" cache-line based on age-bits.
- In such an implementation, every time a cache-line is used, the age of all other cache-lines changes -
- Check if the page is present in cache. @@ -170,7 +170,7 @@ Algorithm explanation
- In the algorithm below we used two different data structure, one is linked list and other one is a hash map diff --git a/d3/df9/recursive__bubble__sort_8cpp.html b/d3/df9/recursive__bubble__sort_8cpp.html index d6296ad75..09f7e82cf 100644 --- a/d3/df9/recursive__bubble__sort_8cpp.html +++ b/d3/df9/recursive__bubble__sort_8cpp.html @@ -135,7 +135,7 @@ Functions
- Go deep to left most node in right subtree. OR, we can also say in case if BST, find the minimum of the subtree for a given node.
- If a node does not have the right subtree, and we already visited the node itself, then the next node will be its parent node according to inorder traversal, and if we are going to parent from left, then the parent would be unvisited.
- In other words, go to the nearest ancestor for which given node would be in left subtree.
- In case if there is no link from a child node to the parent node, we need to walk down the tree starting from the root node to the given node, by doing so, we are visiting every ancestor of the given node. diff --git a/d4/d38/power__of__two_8cpp.html b/d4/d38/power__of__two_8cpp.html index 1516e442d..0b4ab870b 100644 --- a/d4/d38/power__of__two_8cpp.html +++ b/d4/d38/power__of__two_8cpp.html @@ -125,7 +125,7 @@ Functions
- Note
- This implementation is better than naive recursive or iterative approach.
- Sublist search is used to detect a presence of one list in another list.
- Suppose we have a single-node list (let's say the first list), and we want to ensure that the list is present in another list (let's say the second list), then we can perform the sublist search to find it.
- For instance, the first list contains these elements: 23 -> 30 -> 41, and the second list contains these elements: 10 -> 15 -> 23 -> 30 -> 41 -> 49. At a glance, we see that the first list presents in the second list.
- The sublist search algorithm works by comparing the first element of the first list with the first element of the second list. diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index c97637004..9db460b44 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -257,6 +257,7 @@ Hashing
- Linear Probing Hash Table
- Md5
- Quadratic Probing Hash Table +
- Sha1
- Note
- This is a simple implementation for a byte string but some implmenetations can work on bytestream, messages of unknown length.
- Parameters
-
+
+
+message Plain character message to hash
+ - Returns
- void* Pointer to the SHA-1 signature
- Parameters
-
+
+
+input_bs The bytestring to hash input_size The size (in BYTES) of the input
+ - Returns
- void* Pointer to the 160-bit signature
- Returns
- void
- Parameters
-
+
+
+n Integer to rotate rotate How many bits for the rotation
+ - Returns
- uint32_t The rotated integer
- Returns
- 0 on exit
- Parameters
-
+
+
+sig The SHA-1 signature (Expected 20 bytes)
+ - Returns
- std::string The hex signature
- Returns
- void
- Generated by
1.9.2
+ - See also
- here for simple number exponentiation algorithm or explaination here.
- Generated by 1.9.2
+
- InSameUnion() : disjoint_set.cpp
- insert() : avltree.cpp
- insertAtTheBeginning() : linkedlist_implentation_usingarray.cpp -
- interactive() : md5.cpp +
- interactive() : md5.cpp, sha1.cpp
- interpolation_search() : interpolation_search.cpp
- InterpolationSearch() : interpolation_search2.cpp
- is_armstrong() : armstrong_number.cpp diff --git a/globals_func_m.html b/globals_func_m.html index 2e78bad35..58ed522d1 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
- main() : graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, inv_sqrt.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp +
- main() : graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, inv_sqrt.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- merge() : merge_sort.cpp
- mergeSort() : merge_sort.cpp diff --git a/globals_func_t.html b/globals_func_t.html index 7ae51fa11..525a93214 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
- ternary_search() : ternary_search.cpp -
- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp +
- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp diff --git a/globals_i.html b/globals_i.html index 862648739..d3d28f433 100644 --- a/globals_i.html +++ b/globals_i.html @@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
- InSameUnion() : disjoint_set.cpp
- insert() : avltree.cpp
- insertAtTheBeginning() : linkedlist_implentation_usingarray.cpp -
- interactive() : md5.cpp +
- interactive() : md5.cpp, sha1.cpp
- interpolation_search() : interpolation_search.cpp
- InterpolationSearch() : interpolation_search2.cpp
- is_armstrong() : armstrong_number.cpp diff --git a/globals_m.html b/globals_m.html index 0a0d451c0..fe4f53050 100644 --- a/globals_m.html +++ b/globals_m.html @@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
- main() : graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, inv_sqrt.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp +
- main() : graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solve.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, avltree.cpp, disjoint_set.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, skip_list.cpp, sparse_table.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, gram_schmidt.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, inv_sqrt.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, bisection_method.cpp, brent_method_extrema.cpp, false_position.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, lu_decompose.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, poisson_dist.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, sparse_table.cpp, binary_search.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- mat_size : matrix_exponentiation.cpp
- matrix : lu_decomposition.h diff --git a/globals_t.html b/globals_t.html index aeffaa9d5..3452febed 100644 --- a/globals_t.html +++ b/globals_t.html @@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
- ternary_search() : ternary_search.cpp -
- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp +
- test() : rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, list_array.cpp, sparse_table.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, jumpgame.cpp, md5.cpp, sha1.cpp, gram_schmidt.cpp, neural_network.cpp, armstrong_number.cpp, check_amicable_pair.cpp, double_factorial.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, inv_sqrt.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, n_bonacci.cpp, n_choose_r.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, rungekutta.cpp, inorder_successor_of_bst.cpp, trie_multiple_search.cpp, smallest_circle.cpp, persistent_seg_tree_lazy_prop.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, bogo_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
- test1() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp
- test2() : hill_cipher.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp
- test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, smallest_circle.cpp diff --git a/index.html b/index.html index 8e1e3d2ab..a6495eaf5 100644 --- a/index.html +++ b/index.html @@ -95,10 +95,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
- The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++. @@ -109,12 +109,12 @@ Features
- Self-checks within programs ensure correct implementations with confidence.
- Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications. -
Detailed Description
An implementation of LRU Cache. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies).
-
+
Logic
+
Algorithm explanation
For a cache of page frame x:
Every time a requested page is not found in cache, that is a miss or page fault, and if the page is present in cache, then its a hit.
-
+
Data Structure used
The working principle of the Bubble sort algorithm.
Bubble sort is a simple sorting algorithm used to rearrange a set of ascending or descending order elements. Bubble sort gets its name from the fact that data "bubbles" to the top of the dataset.
-
+
Algorithm
What is Swap?
Swapping two numbers means that we interchange their values. Often, an additional variable is required for this operation. This is further illustrated in the following:
diff --git a/d4/d32/inorder__successor__of__bst_8cpp.html b/d4/d32/inorder__successor__of__bst_8cpp.html index e013eb776..272dc21ad 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp.html +++ b/d4/d32/inorder__successor__of__bst_8cpp.html @@ -163,21 +163,21 @@ FunctionsDetailed Description
An implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal.
-
+
Case 1: The given node has the right node/subtree
* In this case, the left-most deepest node in the right subtree will
come just after the given node as we go to left deep in inorder.
+
Case 2: The given node does not have a right node/subtree
-
+
Method 1: Use parent pointer (store the address of parent nodes)
-
+
Method 2: Search from the root node
Detailed Description
Implementation to check whether a number is a power of 2 or not.
This algorithm uses bit manipulation to check if a number is a power of 2 or not.
-
+
Algorithm
Let the input number be n, then the bitwise and between n and n-1 will let us know whether the number is power of 2 or not
For Example, If N= 32 then N-1 is 31, if we perform bitwise and of these two numbers then the result will be zero, which indicates that it is the power of 2 If N=23 then N-1 is 22, if we perform bitwise and of these two numbers then the result will not be zero , which indicates that it is not the power of 2
diff --git a/d4/d9f/selection__sort__recursive_8cpp.html b/d4/d9f/selection__sort__recursive_8cpp.html
index 7816d050c..ca4ed0805 100644
--- a/d4/d9f/selection__sort__recursive_8cpp.html
+++ b/d4/d9f/selection__sort__recursive_8cpp.html
@@ -139,7 +139,7 @@ Functions
Detailed Description
Implementation of the Selection sort implementation using recursion.
The selection sort algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list, and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty, and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on the sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
-
+
Implementation
FindMinIndex This function finds the minimum element of the array(list) recursively by simply comparing the minimum element of array reduced size by 1 and compares it to the last element of the array to find the minimum of the whole array.
SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the FindMinIndex function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list.
diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html
index efcf84648..a7674c3d5 100644
--- a/d5/d33/gram__schmidt_8cpp.html
+++ b/d5/d33/gram__schmidt_8cpp.html
@@ -139,7 +139,7 @@ Functions
Detailed Description
Gram Schmidt Orthogonalisation Process
Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.
-
+
Algorithm
Take the first vector of given LI vectors as first vector of Orthogonal vectors. Take projection of second input vector on the first vector of Orthogonal vector and subtract it from the 2nd LI vector. Take projection of third vector on the second vector of Othogonal vectors and subtract it from the 3rd LI vector. Keep repeating the above process until all the vectors in the given input array are exhausted.
For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html
index 4e5a14e91..4479501ff 100644
--- a/d5/d45/sublist__search_8cpp.html
+++ b/d5/d45/sublist__search_8cpp.html
@@ -148,14 +148,14 @@ Functions
Detailed Description
Implementation of the Sublist Search Algorithm
-
+
Algorithm
-
+
Working
Linear Algebra
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 2b0a9a483..5f7fd920d 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of Bogosort algorithm
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.
-
+
Algorithm
Shuffle the array untill array is sorted.
diff --git a/d6/d0c/namespacehashing.html b/d6/d0c/namespacehashing.html
index 15bc289a9..676ec5947 100644
--- a/d6/d0c/namespacehashing.html
+++ b/d6/d0c/namespacehashing.html
@@ -98,7 +98,8 @@ $(document).ready(function(){initNavTree('d6/d0c/namespacehashing.html','../../'
More...
Detailed Description
Hashing algorithms.
-Used for std::copy Used for std::array Used for assert Used for std::memcopy Used for IO operations Used for strings Used for std::vector
+Used for std::copy Used for std::array Used for assert Used for std::memcopy Used for IO operations Used for strings Used for std::vector
+For std::copy For std::array For assert For std::memcopy For IO operations For strings For std::vector
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html
new file mode 100644
index 000000000..f37521c62
--- /dev/null
+++ b/d8/d7a/sha1_8cpp.html
@@ -0,0 +1,637 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: hashing/sha1.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Namespaces |
+Functions
+ sha1.cpp File Reference
+
+
+
+Simple C++ implementation of the SHA-1 Hashing Algorithm
+More...
+#include <algorithm>
+#include <array>
+#include <cassert>
+#include <cstring>
+#include <iostream>
+#include <string>
+#include <vector>
+
+Include dependency graph for sha1.cpp:
+
+
+
+
+
+
+Namespaces
namespace hashing Hashing algorithms.
namespace SHA Functions for the SHA-1 algorithm implementation.
+
+Functions
uint32_t hashing::sha1::leftRotate32bits (uint32_t n, std::size_t rotate) Rotates the bits of a 32-bit unsigned integer. More...
std::string hashing::sha1::sig2hex (void *sig) Transforms the 160-bit SHA-1 signature into a 40 char hex string. More...
void * hashing::sha1::hash_bs (const void *input_bs, uint64_t input_size) The SHA-1 algorithm itself, taking in a bytestring. More...
void * hashing::sha1::hash (const std::string &message) Converts the string to bytestring and calls the main algorithm. More...
static void test () Self-test implementations of well-known SHA-1 hashes. More...
static void interactive () Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed. More...
int main () Main function. More...
+Detailed Description
+Simple C++ implementation of the SHA-1 Hashing Algorithm
+
+SHA-1 is a cryptographic hash function that was developped by the NSA 1995. SHA-1 is not considered secure since around 2010.
+
+Algorithm
+The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added
+Once this is done, the algo breaks down this padded message into 64 bytes chunks. Each chunk is used for one round, a round breaks the chunk into 16 blocks of 4 bytes. These 16 blocks are then extended to 80 blocks using XOR operations on existing blocks (see code for more details). The algorithm will then update its 160-bit state (here represented used 5 32-bits integer) using partial hashes computed using special functions on the blocks previously built. Please take a look at the wikipedia article for more precision on these operations
+Function Documentation
+
+◆ hash()
+
+
+
+
+
+ void * hashing::sha1::hash
+ (
+ const std::string &
+ message )
+
+
+
+
+Converts the string to bytestring and calls the main algorithm.
+
+
+
+
+
+void * hash_bs(const void *input_bs, uint64_t input_size)The MD5 algorithm itself, taking in a bytestring.Definition: md5.cpp:138
+T size(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ hash_bs()
+
+
+
+
+
+ void * hashing::sha1::hash_bs
+ (
+ const void *
+ input_bs,
+
+
+ uint64_t
+ input_size
+
+
+ )
+
+
+
+
+The SHA-1 algorithm itself, taking in a bytestring.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+T copy(T... args)
+uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)Rotates the bits of a 32-bit unsigned integer.Definition: md5.cpp:66
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ interactive()
+
+
+
+
+
+
+
+
+ static void interactive
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+T compare(T... args)
+T endl(T... args)
+T getline(T... args)
+void * hash(const std::string &message)Converts the string to bytestring and calls the main algorithm.Definition: sha1.cpp:210
+std::string sig2hex(void *sig)Transforms the 160-bit SHA-1 signature into a 40 char hex string.Definition: sha1.cpp:66
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ leftRotate32bits()
+
+
+
+
+
+ uint32_t hashing::sha1::leftRotate32bits
+ (
+ uint32_t
+ n,
+
+
+ std::size_t
+ rotate
+
+
+ )
+
+
+
+
+Rotates the bits of a 32-bit unsigned integer.
+
+
+
+
+
+
+◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+Main function.
+
+
+
+
+
+
+
+
+
+
+static void interactive()Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.Definition: sha1.cpp:274
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ sig2hex()
+
+
+
+
+
+ std::string hashing::sha1::sig2hex
+ (
+ void *
+ sig )
+
+
+
+
+Transforms the 160-bit SHA-1 signature into a 40 char hex string.
+
+
+
+
+
+
+
+
+
+
+
+
+T hex(T... args)
+
+
+
+
+◆ test()
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Self-test implementations of well-known SHA-1 hashes.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp.js b/d8/d7a/sha1_8cpp.js
new file mode 100644
index 000000000..5fc332c65
--- /dev/null
+++ b/d8/d7a/sha1_8cpp.js
@@ -0,0 +1,10 @@
+var sha1_8cpp =
+[
+ [ "hash", "d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c", null ],
+ [ "hash_bs", "d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141", null ],
+ [ "interactive", "d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661", null ],
+ [ "leftRotate32bits", "d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0", null ],
+ [ "main", "d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "sig2hex", "d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228", null ],
+ [ "test", "d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
new file mode 100644
index 000000000..80e2bb5c3
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5 b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
new file mode 100644
index 000000000..ad218c923
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
@@ -0,0 +1 @@
+db1071153d7d9deaee9cfba65b7d7333
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
new file mode 100644
index 000000000..3f9c04a68
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
new file mode 100644
index 000000000..cdc862c37
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5 b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
new file mode 100644
index 000000000..db21d6d74
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
@@ -0,0 +1 @@
+676f6bbb9ec27bdd08463d72d8194fd9
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
new file mode 100644
index 000000000..531df49c1
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..7d83d91ef
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..4ac305ce5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+4110f811148cb5fcce3f727ef6fd0768
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..53e3ac228
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
new file mode 100644
index 000000000..008eed166
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
@@ -0,0 +1,6 @@
+
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5 b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
new file mode 100644
index 000000000..f0e0a08f5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
@@ -0,0 +1 @@
+4a3f322836cee01cba7bf3e480606dd2
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
new file mode 100644
index 000000000..2fe198b0a
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..7ebc26ab5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,9 @@
+
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..b58c035e2
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+158d718e1c2d1af2bddfdce778e0a244
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..339ec5773
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,118 @@
+
+
+
+
+
diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html
index 85141a5e6..58d53d773 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -157,13 +157,13 @@ Functions
Detailed Description
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
-
+
Iterative Preorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first right child then left child. Repeat the same set of steps untill the Stack becomes empty. And return the result array as the preorder traversal of a tree.
-
+
Iterative Postorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first left child then right child. Repeat the same set of steps untill the Stack becomes empty. Now reverse the result array and then return it to the calling function as a postorder traversal of a tree.
-
+
Iterative Inorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current. Now iterate and take the current to the extreme left of the tree by traversing only to its left. Pop the elemnt from the stack and assign it to the current. Store the data of current into the result array. Repeat the same set of steps until the Stack becomes empty or the current becomes NULL. And return the result array as the inorder traversal of a tree.
Function Documentation
diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html
index 9270fc600..c73e21702 100644
--- a/dd/d47/namespacemath.html
+++ b/dd/d47/namespacemath.html
@@ -145,7 +145,7 @@ Functions
Mathematical algorithms
Given a recurrence relation; evaluate the value of nth term. For e.g., For fibonacci series, recurrence series is f(n) = f(n-1) + f(n-2) where f(0) = 0 and f(1) = 1. Note that the method used only demonstrates recurrence relation with one variable (n), unlike nCr problem, since it has two (n, r)
-
+
Algorithm
This problem can be solved using matrix exponentiation method.
diff --git a/de/dd3/namespace_s_h_a.html b/de/dd3/namespace_s_h_a.html
new file mode 100644
index 000000000..8528ca8e3
--- /dev/null
+++ b/de/dd3/namespace_s_h_a.html
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: SHA Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ SHA Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
diff --git a/df/d66/vector__cross__product_8cpp.html b/df/d66/vector__cross__product_8cpp.html
index 32b470697..2e6addfbc 100644
--- a/df/d66/vector__cross__product_8cpp.html
+++ b/df/d66/vector__cross__product_8cpp.html
@@ -144,7 +144,7 @@ Functions
The direction ratios (DR) are calculated as follows: 1st DR, J: (b * z) - (c * y) 2nd DR, A: -((a * z) - (c * x)) 3rd DR, N: (a * y) - (b * x)
Therefore, the direction ratios of the cross product are: J, A, N The following C++ Program calculates the direction ratios of the cross products of two vector. The program uses a function, cross() for doing so. The direction ratios for the first and the second vector has to be passed one by one seperated by a space character.
Magnitude of a vector is the square root of the sum of the squares of the direction ratios.
-
+
Example:
An example of a running instance of the executable program:
Pass the first Vector: 1 2 3
Pass the second Vector: 4 5 6 The cross product is: -3 6 -3 Magnitude: 7.34847
diff --git a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
index f9a98684d..11293f39e 100644
--- a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
+++ b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
@@ -111,6 +111,9 @@ Files
file quadratic_probing_hash_table.cpp Storage mechanism using quadratic probing hash keys.
file sha1.cpp Simple C++ implementation of the SHA-1 Hashing Algorithm
► linear_algebra ► machine_learning - m -
-- t -
Here is a list of all documented file members with links to the documentation:
- m -
-- t -
-
+
Overview
This repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. These algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.
-
+
Features
+
Documentation
Online Documentation is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on Files menu to see the list of all the files documented with the code.
Documentation of Algorithms in C++ by The Algorithms Contributors is licensed under CC BY-SA 4.0
-
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.
diff --git a/namespaces.html b/namespaces.html
index 69a1f8980..395a09746 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -260,41 +260,42 @@ solve-a-rat-in-a-maze-c-java-pytho/"
Nselection_sort_recursive Functions for the Selection sort implementation using recursion Nshortest_common_supersequence Shortest Common Super Sequence algorithm Nsorting Sorting algorithms Nsparse_table Functions for Implementation of Sparse Table Nspirograph ►Nstatistics Statistical algorithms ►Nstd STL namespace Nstrand Functions for Strand Sort algorithm Nstring_search String search algorithms Nstrings Algorithms with strings Nsubarray_sum Functions for the Subset sum implementation Nsublist_search Functions for the Sublist Search implementation NSubsets Functions for the Subset Sum problem Ntree_234 Functions for 2–3–4 tree Ntrie_operations Functions for Trie datastructure implementation Ntrie_using_hashmap Functions for Trie data structure using hashmap implementation Nutil_functions Various utility functions used in Neural network Nvector_cross Functions for Vector Cross Product algorithms Nvigenere Functions for vigenère cipher algorithm Nwave_sort Functions for the Wave sort implementation Nwiggle_sort Functions for Wiggle Sort algorithm Nwildcard_matching Functions for the Wildcard Matching problem Nword_break Functions for Word Break problem NXOR Functions for XOR cipher algorithm NSHA Functions for the SHA-1 algorithm implementation Nshortest_common_supersequence Shortest Common Super Sequence algorithm Nsorting Sorting algorithms Nsparse_table Functions for Implementation of Sparse Table Nspirograph ►Nstatistics Statistical algorithms ►Nstd STL namespace Nstrand Functions for Strand Sort algorithm Nstring_search String search algorithms Nstrings Algorithms with strings Nsubarray_sum Functions for the Subset sum implementation Nsublist_search Functions for the Sublist Search implementation NSubsets Functions for the Subset Sum problem Ntree_234 Functions for 2–3–4 tree Ntrie_operations Functions for Trie datastructure implementation Ntrie_using_hashmap Functions for Trie data structure using hashmap implementation Nutil_functions Various utility functions used in Neural network Nvector_cross Functions for Vector Cross Product algorithms Nvigenere Functions for vigenère cipher algorithm Nwave_sort Functions for the Wave sort implementation Nwiggle_sort Functions for Wiggle Sort algorithm Nwildcard_matching Functions for the Wildcard Matching problem Nword_break Functions for Word Break problem NXOR Functions for XOR cipher algorithm
Method 1: Use parent pointer (store the address of parent nodes)
+
Method 2: Search from the root node
Detailed Description
Implementation to check whether a number is a power of 2 or not.
This algorithm uses bit manipulation to check if a number is a power of 2 or not.
-
+
Algorithm
Let the input number be n, then the bitwise and between n and n-1 will let us know whether the number is power of 2 or not
For Example, If N= 32 then N-1 is 31, if we perform bitwise and of these two numbers then the result will be zero, which indicates that it is the power of 2 If N=23 then N-1 is 22, if we perform bitwise and of these two numbers then the result will not be zero , which indicates that it is not the power of 2
diff --git a/d4/d9f/selection__sort__recursive_8cpp.html b/d4/d9f/selection__sort__recursive_8cpp.html
index 7816d050c..ca4ed0805 100644
--- a/d4/d9f/selection__sort__recursive_8cpp.html
+++ b/d4/d9f/selection__sort__recursive_8cpp.html
@@ -139,7 +139,7 @@ Functions
Detailed Description
Implementation of the Selection sort implementation using recursion.
The selection sort algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list, and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty, and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on the sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
-
+
Implementation
FindMinIndex This function finds the minimum element of the array(list) recursively by simply comparing the minimum element of array reduced size by 1 and compares it to the last element of the array to find the minimum of the whole array.
SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the FindMinIndex function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list.
diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html
index efcf84648..a7674c3d5 100644
--- a/d5/d33/gram__schmidt_8cpp.html
+++ b/d5/d33/gram__schmidt_8cpp.html
@@ -139,7 +139,7 @@ Functions
Detailed Description
Gram Schmidt Orthogonalisation Process
Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.
-
+
Algorithm
Take the first vector of given LI vectors as first vector of Orthogonal vectors. Take projection of second input vector on the first vector of Orthogonal vector and subtract it from the 2nd LI vector. Take projection of third vector on the second vector of Othogonal vectors and subtract it from the 3rd LI vector. Keep repeating the above process until all the vectors in the given input array are exhausted.
For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html
index 4e5a14e91..4479501ff 100644
--- a/d5/d45/sublist__search_8cpp.html
+++ b/d5/d45/sublist__search_8cpp.html
@@ -148,14 +148,14 @@ Functions
Detailed Description
Implementation of the Sublist Search Algorithm
-
+
Algorithm
-
+
Working
Linear Algebra
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 2b0a9a483..5f7fd920d 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of Bogosort algorithm
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.
-
+
Algorithm
Shuffle the array untill array is sorted.
diff --git a/d6/d0c/namespacehashing.html b/d6/d0c/namespacehashing.html
index 15bc289a9..676ec5947 100644
--- a/d6/d0c/namespacehashing.html
+++ b/d6/d0c/namespacehashing.html
@@ -98,7 +98,8 @@ $(document).ready(function(){initNavTree('d6/d0c/namespacehashing.html','../../'
More...
Detailed Description
Hashing algorithms.
-Used for std::copy Used for std::array Used for assert Used for std::memcopy Used for IO operations Used for strings Used for std::vector
+Used for std::copy Used for std::array Used for assert Used for std::memcopy Used for IO operations Used for strings Used for std::vector
+For std::copy For std::array For assert For std::memcopy For IO operations For strings For std::vector
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html
new file mode 100644
index 000000000..f37521c62
--- /dev/null
+++ b/d8/d7a/sha1_8cpp.html
@@ -0,0 +1,637 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: hashing/sha1.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Namespaces |
+Functions
+ sha1.cpp File Reference
+
+
+
+Simple C++ implementation of the SHA-1 Hashing Algorithm
+More...
+#include <algorithm>
+#include <array>
+#include <cassert>
+#include <cstring>
+#include <iostream>
+#include <string>
+#include <vector>
+
+Include dependency graph for sha1.cpp:
+
+
+
+
+
+
+Namespaces
namespace hashing Hashing algorithms.
namespace SHA Functions for the SHA-1 algorithm implementation.
+
+Functions
uint32_t hashing::sha1::leftRotate32bits (uint32_t n, std::size_t rotate) Rotates the bits of a 32-bit unsigned integer. More...
std::string hashing::sha1::sig2hex (void *sig) Transforms the 160-bit SHA-1 signature into a 40 char hex string. More...
void * hashing::sha1::hash_bs (const void *input_bs, uint64_t input_size) The SHA-1 algorithm itself, taking in a bytestring. More...
void * hashing::sha1::hash (const std::string &message) Converts the string to bytestring and calls the main algorithm. More...
static void test () Self-test implementations of well-known SHA-1 hashes. More...
static void interactive () Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed. More...
int main () Main function. More...
+Detailed Description
+Simple C++ implementation of the SHA-1 Hashing Algorithm
+
+SHA-1 is a cryptographic hash function that was developped by the NSA 1995. SHA-1 is not considered secure since around 2010.
+
+Algorithm
+The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added
+Once this is done, the algo breaks down this padded message into 64 bytes chunks. Each chunk is used for one round, a round breaks the chunk into 16 blocks of 4 bytes. These 16 blocks are then extended to 80 blocks using XOR operations on existing blocks (see code for more details). The algorithm will then update its 160-bit state (here represented used 5 32-bits integer) using partial hashes computed using special functions on the blocks previously built. Please take a look at the wikipedia article for more precision on these operations
+Function Documentation
+
+◆ hash()
+
+
+
+
+
+ void * hashing::sha1::hash
+ (
+ const std::string &
+ message )
+
+
+
+
+Converts the string to bytestring and calls the main algorithm.
+
+
+
+
+
+void * hash_bs(const void *input_bs, uint64_t input_size)The MD5 algorithm itself, taking in a bytestring.Definition: md5.cpp:138
+T size(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ hash_bs()
+
+
+
+
+
+ void * hashing::sha1::hash_bs
+ (
+ const void *
+ input_bs,
+
+
+ uint64_t
+ input_size
+
+
+ )
+
+
+
+
+The SHA-1 algorithm itself, taking in a bytestring.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+T copy(T... args)
+uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)Rotates the bits of a 32-bit unsigned integer.Definition: md5.cpp:66
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ interactive()
+
+
+
+
+
+
+
+
+ static void interactive
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+T compare(T... args)
+T endl(T... args)
+T getline(T... args)
+void * hash(const std::string &message)Converts the string to bytestring and calls the main algorithm.Definition: sha1.cpp:210
+std::string sig2hex(void *sig)Transforms the 160-bit SHA-1 signature into a 40 char hex string.Definition: sha1.cpp:66
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ leftRotate32bits()
+
+
+
+
+
+ uint32_t hashing::sha1::leftRotate32bits
+ (
+ uint32_t
+ n,
+
+
+ std::size_t
+ rotate
+
+
+ )
+
+
+
+
+Rotates the bits of a 32-bit unsigned integer.
+
+
+
+
+
+
+◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+Main function.
+
+
+
+
+
+
+
+
+
+
+static void interactive()Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.Definition: sha1.cpp:274
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ sig2hex()
+
+
+
+
+
+ std::string hashing::sha1::sig2hex
+ (
+ void *
+ sig )
+
+
+
+
+Transforms the 160-bit SHA-1 signature into a 40 char hex string.
+
+
+
+
+
+
+
+
+
+
+
+
+T hex(T... args)
+
+
+
+
+◆ test()
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Self-test implementations of well-known SHA-1 hashes.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp.js b/d8/d7a/sha1_8cpp.js
new file mode 100644
index 000000000..5fc332c65
--- /dev/null
+++ b/d8/d7a/sha1_8cpp.js
@@ -0,0 +1,10 @@
+var sha1_8cpp =
+[
+ [ "hash", "d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c", null ],
+ [ "hash_bs", "d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141", null ],
+ [ "interactive", "d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661", null ],
+ [ "leftRotate32bits", "d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0", null ],
+ [ "main", "d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "sig2hex", "d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228", null ],
+ [ "test", "d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
new file mode 100644
index 000000000..80e2bb5c3
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5 b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
new file mode 100644
index 000000000..ad218c923
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
@@ -0,0 +1 @@
+db1071153d7d9deaee9cfba65b7d7333
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
new file mode 100644
index 000000000..3f9c04a68
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
new file mode 100644
index 000000000..cdc862c37
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5 b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
new file mode 100644
index 000000000..db21d6d74
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
@@ -0,0 +1 @@
+676f6bbb9ec27bdd08463d72d8194fd9
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
new file mode 100644
index 000000000..531df49c1
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..7d83d91ef
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..4ac305ce5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+4110f811148cb5fcce3f727ef6fd0768
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..53e3ac228
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
new file mode 100644
index 000000000..008eed166
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
@@ -0,0 +1,6 @@
+
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5 b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
new file mode 100644
index 000000000..f0e0a08f5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
@@ -0,0 +1 @@
+4a3f322836cee01cba7bf3e480606dd2
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
new file mode 100644
index 000000000..2fe198b0a
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..7ebc26ab5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,9 @@
+
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..b58c035e2
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+158d718e1c2d1af2bddfdce778e0a244
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..339ec5773
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,118 @@
+
+
+
+
+
diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html
index 85141a5e6..58d53d773 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -157,13 +157,13 @@ Functions
Detailed Description
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
-
+
Iterative Preorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first right child then left child. Repeat the same set of steps untill the Stack becomes empty. And return the result array as the preorder traversal of a tree.
-
+
Iterative Postorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first left child then right child. Repeat the same set of steps untill the Stack becomes empty. Now reverse the result array and then return it to the calling function as a postorder traversal of a tree.
-
+
Iterative Inorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current. Now iterate and take the current to the extreme left of the tree by traversing only to its left. Pop the elemnt from the stack and assign it to the current. Store the data of current into the result array. Repeat the same set of steps until the Stack becomes empty or the current becomes NULL. And return the result array as the inorder traversal of a tree.
Function Documentation
diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html
index 9270fc600..c73e21702 100644
--- a/dd/d47/namespacemath.html
+++ b/dd/d47/namespacemath.html
@@ -145,7 +145,7 @@ Functions
Mathematical algorithms
Given a recurrence relation; evaluate the value of nth term. For e.g., For fibonacci series, recurrence series is f(n) = f(n-1) + f(n-2) where f(0) = 0 and f(1) = 1. Note that the method used only demonstrates recurrence relation with one variable (n), unlike nCr problem, since it has two (n, r)
-
+
Algorithm
This problem can be solved using matrix exponentiation method.
diff --git a/de/dd3/namespace_s_h_a.html b/de/dd3/namespace_s_h_a.html
new file mode 100644
index 000000000..8528ca8e3
--- /dev/null
+++ b/de/dd3/namespace_s_h_a.html
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: SHA Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ SHA Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
diff --git a/df/d66/vector__cross__product_8cpp.html b/df/d66/vector__cross__product_8cpp.html
index 32b470697..2e6addfbc 100644
--- a/df/d66/vector__cross__product_8cpp.html
+++ b/df/d66/vector__cross__product_8cpp.html
@@ -144,7 +144,7 @@ Functions
The direction ratios (DR) are calculated as follows: 1st DR, J: (b * z) - (c * y) 2nd DR, A: -((a * z) - (c * x)) 3rd DR, N: (a * y) - (b * x)
Therefore, the direction ratios of the cross product are: J, A, N The following C++ Program calculates the direction ratios of the cross products of two vector. The program uses a function, cross() for doing so. The direction ratios for the first and the second vector has to be passed one by one seperated by a space character.
Magnitude of a vector is the square root of the sum of the squares of the direction ratios.
-
+
Example:
An example of a running instance of the executable program:
Pass the first Vector: 1 2 3
Pass the second Vector: 4 5 6 The cross product is: -3 6 -3 Magnitude: 7.34847
diff --git a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
index f9a98684d..11293f39e 100644
--- a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
+++ b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
@@ -111,6 +111,9 @@ Files
file quadratic_probing_hash_table.cpp Storage mechanism using quadratic probing hash keys.
file sha1.cpp Simple C++ implementation of the SHA-1 Hashing Algorithm
► linear_algebra ► machine_learning - m -
-- t -
Here is a list of all documented file members with links to the documentation:
- m -
-- t -
-
+
Overview
This repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. These algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.
-
+
Features
+
Documentation
Online Documentation is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on Files menu to see the list of all the files documented with the code.
Documentation of Algorithms in C++ by The Algorithms Contributors is licensed under CC BY-SA 4.0
-
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.
diff --git a/namespaces.html b/namespaces.html
index 69a1f8980..395a09746 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -260,41 +260,42 @@ solve-a-rat-in-a-maze-c-java-pytho/"
Nselection_sort_recursive Functions for the Selection sort implementation using recursion Nshortest_common_supersequence Shortest Common Super Sequence algorithm Nsorting Sorting algorithms Nsparse_table Functions for Implementation of Sparse Table Nspirograph ►Nstatistics Statistical algorithms ►Nstd STL namespace Nstrand Functions for Strand Sort algorithm Nstring_search String search algorithms Nstrings Algorithms with strings Nsubarray_sum Functions for the Subset sum implementation Nsublist_search Functions for the Sublist Search implementation NSubsets Functions for the Subset Sum problem Ntree_234 Functions for 2–3–4 tree Ntrie_operations Functions for Trie datastructure implementation Ntrie_using_hashmap Functions for Trie data structure using hashmap implementation Nutil_functions Various utility functions used in Neural network Nvector_cross Functions for Vector Cross Product algorithms Nvigenere Functions for vigenère cipher algorithm Nwave_sort Functions for the Wave sort implementation Nwiggle_sort Functions for Wiggle Sort algorithm Nwildcard_matching Functions for the Wildcard Matching problem Nword_break Functions for Word Break problem NXOR Functions for XOR cipher algorithm NSHA Functions for the SHA-1 algorithm implementation Nshortest_common_supersequence Shortest Common Super Sequence algorithm Nsorting Sorting algorithms Nsparse_table Functions for Implementation of Sparse Table Nspirograph ►Nstatistics Statistical algorithms ►Nstd STL namespace Nstrand Functions for Strand Sort algorithm Nstring_search String search algorithms Nstrings Algorithms with strings Nsubarray_sum Functions for the Subset sum implementation Nsublist_search Functions for the Sublist Search implementation NSubsets Functions for the Subset Sum problem Ntree_234 Functions for 2–3–4 tree Ntrie_operations Functions for Trie datastructure implementation Ntrie_using_hashmap Functions for Trie data structure using hashmap implementation Nutil_functions Various utility functions used in Neural network Nvector_cross Functions for Vector Cross Product algorithms Nvigenere Functions for vigenère cipher algorithm Nwave_sort Functions for the Wave sort implementation Nwiggle_sort Functions for Wiggle Sort algorithm Nwildcard_matching Functions for the Wildcard Matching problem Nword_break Functions for Word Break problem NXOR Functions for XOR cipher algorithm
Detailed Description
Implementation to check whether a number is a power of 2 or not.
This algorithm uses bit manipulation to check if a number is a power of 2 or not.
-
+
Algorithm
Let the input number be n, then the bitwise and between n and n-1 will let us know whether the number is power of 2 or not
For Example, If N= 32 then N-1 is 31, if we perform bitwise and of these two numbers then the result will be zero, which indicates that it is the power of 2 If N=23 then N-1 is 22, if we perform bitwise and of these two numbers then the result will not be zero , which indicates that it is not the power of 2
Detailed Description
Implementation of the Selection sort implementation using recursion.
The selection sort algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list, and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty, and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on the sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
-
+
Implementation
FindMinIndex This function finds the minimum element of the array(list) recursively by simply comparing the minimum element of array reduced size by 1 and compares it to the last element of the array to find the minimum of the whole array.
SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the FindMinIndex function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list.
Detailed Description
Gram Schmidt Orthogonalisation Process
Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.
-
+
Algorithm
Take the first vector of given LI vectors as first vector of Orthogonal vectors. Take projection of second input vector on the first vector of Orthogonal vector and subtract it from the 2nd LI vector. Take projection of third vector on the second vector of Othogonal vectors and subtract it from the 3rd LI vector. Keep repeating the above process until all the vectors in the given input array are exhausted.
For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html index 4e5a14e91..4479501ff 100644 --- a/d5/d45/sublist__search_8cpp.html +++ b/d5/d45/sublist__search_8cpp.html @@ -148,14 +148,14 @@ FunctionsDetailed Description
Implementation of the Sublist Search Algorithm
-
+
Algorithm
-
+
Working
Linear Algebra
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 2b0a9a483..5f7fd920d 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -135,7 +135,7 @@ Functions
Detailed Description
Implementation of Bogosort algorithm
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.
-
+
Algorithm
Shuffle the array untill array is sorted.
diff --git a/d6/d0c/namespacehashing.html b/d6/d0c/namespacehashing.html
index 15bc289a9..676ec5947 100644
--- a/d6/d0c/namespacehashing.html
+++ b/d6/d0c/namespacehashing.html
@@ -98,7 +98,8 @@ $(document).ready(function(){initNavTree('d6/d0c/namespacehashing.html','../../'
More...
Detailed Description
Hashing algorithms.
-Used for std::copy Used for std::array Used for assert Used for std::memcopy Used for IO operations Used for strings Used for std::vector
+Used for std::copy Used for std::array Used for assert Used for std::memcopy Used for IO operations Used for strings Used for std::vector
+For std::copy For std::array For assert For std::memcopy For IO operations For strings For std::vector
Working
Linear Algebra
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html index 2b0a9a483..5f7fd920d 100644 --- a/d5/ddb/bogo__sort_8cpp.html +++ b/d5/ddb/bogo__sort_8cpp.html @@ -135,7 +135,7 @@ FunctionsDetailed Description
Implementation of Bogosort algorithm
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.
-
+
Algorithm
Shuffle the array untill array is sorted.
diff --git a/d6/d0c/namespacehashing.html b/d6/d0c/namespacehashing.html index 15bc289a9..676ec5947 100644 --- a/d6/d0c/namespacehashing.html +++ b/d6/d0c/namespacehashing.html @@ -98,7 +98,8 @@ $(document).ready(function(){initNavTree('d6/d0c/namespacehashing.html','../../' More...Detailed Description
Hashing algorithms.
-Used for std::copy Used for std::array Used for assert Used for std::memcopy Used for IO operations Used for strings Used for std::vector
+Used for std::copy Used for std::array Used for assert Used for std::memcopy Used for IO operations Used for strings Used for std::vector
+For std::copy For std::array For assert For std::memcopy For IO operations For strings For std::vector
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Namespaces |
+Functions
+ sha1.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+Simple C++ implementation of the SHA-1 Hashing Algorithm +More...
+#include <algorithm>+
#include <array>+
#include <cassert>+
#include <cstring>+
#include <iostream>+
#include <string>+
#include <vector>+
+Include dependency graph for sha1.cpp:
+
+
+
+
++Namespaces | |
| namespace | hashing |
| Hashing algorithms. | |
| namespace | SHA |
| Functions for the SHA-1 algorithm implementation. | |
+Functions | |
| uint32_t | hashing::sha1::leftRotate32bits (uint32_t n, std::size_t rotate) |
| Rotates the bits of a 32-bit unsigned integer. More... | |
| std::string | hashing::sha1::sig2hex (void *sig) |
| Transforms the 160-bit SHA-1 signature into a 40 char hex string. More... | |
| void * | hashing::sha1::hash_bs (const void *input_bs, uint64_t input_size) |
| The SHA-1 algorithm itself, taking in a bytestring. More... | |
| void * | hashing::sha1::hash (const std::string &message) |
| Converts the string to bytestring and calls the main algorithm. More... | |
| static void | test () |
| Self-test implementations of well-known SHA-1 hashes. More... | |
| static void | interactive () |
| Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed. More... | |
| int | main () |
| Main function. More... | |
Detailed Description
+Simple C++ implementation of the SHA-1 Hashing Algorithm
+ +SHA-1 is a cryptographic hash function that was developped by the NSA 1995. SHA-1 is not considered secure since around 2010.
++Algorithm
+The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added
+Once this is done, the algo breaks down this padded message into 64 bytes chunks. Each chunk is used for one round, a round breaks the chunk into 16 blocks of 4 bytes. These 16 blocks are then extended to 80 blocks using XOR operations on existing blocks (see code for more details). The algorithm will then update its 160-bit state (here represented used 5 32-bits integer) using partial hashes computed using special functions on the blocks previously built. Please take a look at the wikipedia article for more precision on these operations
Function Documentation
+ +◆ hash()
+ +
+
+
+
+
+
+
| void * hashing::sha1::hash | +( | +const std::string & | +message | ) | ++ |
+
+
+Converts the string to bytestring and calls the main algorithm.
+
+
+
+
+
+
void * hash_bs(const void *input_bs, uint64_t input_size)
The MD5 algorithm itself, taking in a bytestring.
Definition: md5.cpp:138
T size(T... args)
+Here is the call graph for this function:
+
+
+
+
+
+◆ hash_bs()
+ +
+
+
+
+
+
+
| void * hashing::sha1::hash_bs | +( | +const void * | +input_bs, | +
| + | + | uint64_t | +input_size | +
| + | ) | ++ |
+
+
+The SHA-1 algorithm itself, taking in a bytestring.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
T copy(T... args)
uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)
Rotates the bits of a 32-bit unsigned integer.
Definition: md5.cpp:66
+Here is the call graph for this function:
+
+
+
+
+
+◆ interactive()
+ +
+
+
+
+
+
+
+
|
+ +static | +
+
+
+Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
T compare(T... args)
T endl(T... args)
T getline(T... args)
void * hash(const std::string &message)
Converts the string to bytestring and calls the main algorithm.
Definition: sha1.cpp:210
std::string sig2hex(void *sig)
Transforms the 160-bit SHA-1 signature into a 40 char hex string.
Definition: sha1.cpp:66
+Here is the call graph for this function:
+
+
+
+
+
+◆ leftRotate32bits()
+ +
+
+
+
+
+
+
| uint32_t hashing::sha1::leftRotate32bits | +( | +uint32_t | +n, | +
| + | + | std::size_t | +rotate | +
| + | ) | ++ |
+
+
+Rotates the bits of a 32-bit unsigned integer.
+◆ main()
+ +
+
+
+
+
+
+
| int main | +( | +void | +) | ++ |
+
+
+Main function.
+
+
+
+
+
+
+
+
+
+
+
static void interactive()
Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.
Definition: sha1.cpp:274
+Here is the call graph for this function:
+
+
+
+
+
+◆ sig2hex()
+ +
+
+
+
+
+
+
| std::string hashing::sha1::sig2hex | +( | +void * | +sig | ) | ++ |
+
+
+Transforms the 160-bit SHA-1 signature into a 40 char hex string.
+
+
+
+
+
+
+
+
+
+
+
+
+T hex(T... args)
◆ test()
+ +
+
+
+
+
+
+
|
+ +static | +
+
+
+Self-test implementations of well-known SHA-1 hashes.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp.js b/d8/d7a/sha1_8cpp.js
new file mode 100644
index 000000000..5fc332c65
--- /dev/null
+++ b/d8/d7a/sha1_8cpp.js
@@ -0,0 +1,10 @@
+var sha1_8cpp =
+[
+ [ "hash", "d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c", null ],
+ [ "hash_bs", "d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141", null ],
+ [ "interactive", "d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661", null ],
+ [ "leftRotate32bits", "d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0", null ],
+ [ "main", "d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "sig2hex", "d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228", null ],
+ [ "test", "d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
new file mode 100644
index 000000000..80e2bb5c3
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5 b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
new file mode 100644
index 000000000..ad218c923
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
@@ -0,0 +1 @@
+db1071153d7d9deaee9cfba65b7d7333
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
new file mode 100644
index 000000000..3f9c04a68
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
new file mode 100644
index 000000000..cdc862c37
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5 b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
new file mode 100644
index 000000000..db21d6d74
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
@@ -0,0 +1 @@
+676f6bbb9ec27bdd08463d72d8194fd9
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
new file mode 100644
index 000000000..531df49c1
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..7d83d91ef
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..4ac305ce5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+4110f811148cb5fcce3f727ef6fd0768
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..53e3ac228
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
new file mode 100644
index 000000000..008eed166
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
@@ -0,0 +1,6 @@
+
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5 b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
new file mode 100644
index 000000000..f0e0a08f5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
@@ -0,0 +1 @@
+4a3f322836cee01cba7bf3e480606dd2
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
new file mode 100644
index 000000000..2fe198b0a
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..7ebc26ab5
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,9 @@
+
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..b58c035e2
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+158d718e1c2d1af2bddfdce778e0a244
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..339ec5773
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,118 @@
+
+
+
+
+
diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html
index 85141a5e6..58d53d773 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -157,13 +157,13 @@ Functions
-
+
+
Detailed Description
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
-
+
Iterative Preorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first right child then left child. Repeat the same set of steps untill the Stack becomes empty. And return the result array as the preorder traversal of a tree.
-
+
Iterative Postorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first left child then right child. Repeat the same set of steps untill the Stack becomes empty. Now reverse the result array and then return it to the calling function as a postorder traversal of a tree.
-
+
Iterative Inorder Traversal of a tree
Create a Stack that will store the Node of Tree. Push the root node into the stack. Save the root into the variabe named as current. Now iterate and take the current to the extreme left of the tree by traversing only to its left. Pop the elemnt from the stack and assign it to the current. Store the data of current into the result array. Repeat the same set of steps until the Stack becomes empty or the current becomes NULL. And return the result array as the inorder traversal of a tree.
Function Documentation
diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index 9270fc600..c73e21702 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -145,7 +145,7 @@ FunctionsMathematical algorithms
Given a recurrence relation; evaluate the value of nth term. For e.g., For fibonacci series, recurrence series is f(n) = f(n-1) + f(n-2) where f(0) = 0 and f(1) = 1. Note that the method used only demonstrates recurrence relation with one variable (n), unlike nCr problem, since it has two (n, r)
+
Algorithm
This problem can be solved using matrix exponentiation method.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+SHA Namespace Reference
+
+
+
diff --git a/df/d66/vector__cross__product_8cpp.html b/df/d66/vector__cross__product_8cpp.html
index 32b470697..2e6addfbc 100644
--- a/df/d66/vector__cross__product_8cpp.html
+++ b/df/d66/vector__cross__product_8cpp.html
@@ -144,7 +144,7 @@ Functions
-
+
+
The direction ratios (DR) are calculated as follows: 1st DR, J: (b * z) - (c * y) 2nd DR, A: -((a * z) - (c * x)) 3rd DR, N: (a * y) - (b * x)
Therefore, the direction ratios of the cross product are: J, A, N The following C++ Program calculates the direction ratios of the cross products of two vector. The program uses a function, cross() for doing so. The direction ratios for the first and the second vector has to be passed one by one seperated by a space character.
Magnitude of a vector is the square root of the sum of the squares of the direction ratios.
-
+
Example:
An example of a running instance of the executable program:
Pass the first Vector: 1 2 3
Pass the second Vector: 4 5 6 The cross product is: -3 6 -3 Magnitude: 7.34847
diff --git a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html index f9a98684d..11293f39e 100644 --- a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html +++ b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html @@ -111,6 +111,9 @@ Files- m -
-
-
- t -
Here is a list of all documented file members with links to the documentation:
- m -
-
-
- t -
+
Overview
This repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. These algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.
-
+
Features
+
Documentation
Online Documentation is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on Files menu to see the list of all the files documented with the code.
Documentation of Algorithms in C++ by The Algorithms Contributors is licensed under CC BY-SA 4.0
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.