Project: C-Plus-Plus (GitHub Link)

C-Plus-Plus-master
- .github
  - pull_request_template.md
  - ISSUE_TEMPLATE
    - feature_request.md
    - bug_report.md
  - workflows
    - awesome_workflow.yml
    - gh-pages.yml
- hashing
  - quadratic_probing_hash_table.cpp
  - linear_probing_hash_table.cpp
  - double_hash_hash_table.cpp
  - chaining.cpp
- graph
  - lca.cpp
  - kruskal.cpp
  - bfs.cpp
  - connected_components.cpp
  - prim.cpp
  - topological_sort_by_kahns_algo.cpp
  - dfs_with_stack.cpp
  - dfs.cpp
  - topological_sort.cpp
  - max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
  - connected_components_with_dsu.cpp
  - cycle_check_directed_graph.cpp
  - kosaraju.cpp
  - dijkstra.cpp
  - bridge_finding_with_tarjan_algorithm.cpp
- data_structures
  - binary_search_tree.cpp
  - queue_using_linked_list.cpp
  - stack.h
  - queue_using_array2.cpp
  - avltree.cpp
  - student.txt
  - morrisinorder.cpp
  - disjoint_set.cpp
  - tree.cpp
  - circular_queue_using_linked_list.cpp
  - queue.h
  - stack_using_array.cpp
  - list_array.cpp
  - binaryheap.cpp
  - linked_list.cpp
  - doubly_linked_list.cpp
  - trie_modern.cpp
  - queue_using_linkedlist.cpp
  - queue_using_array.cpp
  - CMakeLists.txt
  - test_stack_students.cpp
  - test_queue.cpp
  - test_stack.cpp
  - stack_using_linked_list.cpp
  - trie_tree.cpp
  - linkedlist_implentation_usingarray.cpp
  - cll
    - cll.h
    - cll.cpp
    - CMakeLists.txt
    - main_cll.cpp
- geometry
  - line_segment_intersection.cpp
  - CMakeLists.txt
- machine_learning
  - kohonen_som_topology.cpp
  - adaline_learning.cpp
  - CMakeLists.txt
  - ordinary_least_squares_regressor.cpp
  - kohonen_som_trace.cpp
- backtracking
  - n_queens_all_solution_optimised.cpp
  - n_queens.cpp
  - rat_maze.cpp
  - nqueen_print_all_solutions.cpp
  - minimax.cpp
  - graph_coloring.cpp
  - knight_tour.cpp
  - sudoku_solve.cpp
- search
  - linear_search.cpp
  - interpolation_search2.cpp
  - text_search.cpp
  - jump_search.cpp
  - exponential_search.cpp
  - median_search.cpp
  - interpolation_search.cpp
  - CMakeLists.txt
  - binary_search.cpp
  - ternary_search.cpp
  - hash_search.cpp
- DIRECTORY.md
- sorting
  - merge_sort.cpp
  - library_sort.cpp
  - bubble_sort.cpp
  - non_recursive_merge_sort.cpp
  - bitonic_sort.cpp
  - tim_sort.cpp
  - comb_sort.cpp
  - shell_sort.cpp
  - heap_sort.cpp
  - cocktail_selection_sort.cpp
  - counting_sort.cpp
  - numeric_string_sort.cpp
  - quick_sort.cpp
  - radix_sort.cpp
  - counting_sort_string.cpp
  - shell_sort2.cpp
  - bucket_sort.cpp
  - CMakeLists.txt
  - selection_sort.cpp
  - bead_sort.cpp
  - insertion_sort.cpp
  - odd_even_sort.cpp
  - slow_sort.cpp
  - swap_sort.cpp
- LICENSE
- CONTRIBUTING.md
- dynamic_programming
  - cut_rod.cpp
  - longest_common_string.cpp
  - armstrong_number.cpp
  - floyd_warshall.cpp
  - 0_1_knapsack.cpp
  - kadane.cpp
  - longest_increasing_subsequence_(nlogn).cpp
  - fibonacci_bottom_up.cpp
  - fibonacci_top_down.cpp
  - egg_dropping_puzzle.cpp
  - catalan_numbers.cpp
  - searching_of_element_in_dynamic_array.cpp
  - edit_distance.cpp
  - bellman_ford.cpp
  - longest_increasing_subsequence.cpp
  - tree_height.cpp
  - longest_common_subsequence.cpp
  - coin_change.cpp
  - matrix_chain_multiplication.cpp
- others
  - decimal_to_hexadecimal.cpp
  - spiral_print.cpp
  - primality_test.cpp
  - pascal_triangle.cpp
  - buzz_number.cpp
  - tower_of_hanoi.cpp
  - fast_interger_input.cpp
  - sparse_matrix.cpp
  - vector_important_functions.cpp
  - matrix_exponentiation.cpp
  - decimal_to_roman_numeral.cpp
  - stairs_pattern.cpp
  - CMakeLists.txt
  - decimal_to_binary.cpp
  - paranthesis_matching.cpp
  - palindrome_of_number.cpp
  - happy_number.cpp
  - smallest_circle.cpp
- operations_on_datastructures
  - circular_linked_list.cpp
  - get_size_of_linked_list.cpp
  - array_left_rotation.cpp
  - union_of_2_arrays.cpp
  - array_right_rotation.cpp
  - reverse_a_linked_list_using_recusion.cpp
  - circular_queue_using_array.cpp
  - intersection_of_2_arrays.cpp
  - selectionsortlinkedlist.cpp
- strings
  - brute_force_string_searching.cpp
  - rabin_karp.cpp
  - knuth_morris_pratt.cpp
  - CMakeLists.txt
- greedy_algorithms
  - huffman.cpp
  - knapsack.cpp
  - prims_minimum_spanning_tree.cpp
  - kruskals_minimum_spanning_tree.cpp
  - dijkstra.cpp
- probability
  - bayes_theorem.cpp
  - poisson_dist.cpp
  - addition_rule.cpp
  - binomial_dist.cpp
  - CMakeLists.txt
- CMakeLists.txt
- numerical_methods
  - qr_eigen_values.cpp
  - ode_semi_implicit_euler.cpp
  - ode_forward_euler.cpp
  - ode_midpoint_euler.cpp
  - newton_raphson_method.cpp
  - successive_approximation.cpp
  - durand_kerner_roots.cpp
  - qr_decompose.h
  - brent_method_extrema.cpp
  - lu_decomposition.h
  - golden_search_extrema.cpp
  - lu_decompose.cpp
  - CMakeLists.txt
  - qr_decomposition.cpp
  - gaussian_elimination.cpp
  - bisection_method.cpp
  - false_position.cpp
- README.md
- math
  - fibonacci_large.cpp
  - least_common_multiple.cpp
  - factorial.cpp
  - miller_rabin.cpp
  - armstrong_number.cpp
  - modular_inverse_fermat_little_theorem.cpp
  - eulers_totient_function.cpp
  - prime_factorization.cpp
  - sieve_of_eratosthenes.cpp
  - number_of_positive_divisors.cpp
  - complex_numbers.cpp
  - large_factorial.cpp
  - gcd_iterative_euclidean.cpp
  - sum_of_digits.cpp
  - large_number.h
  - sqrt_double.cpp
  - gcd_recursive_euclidean.cpp
  - string_fibonacci.cpp
  - binary_exponent.cpp
  - realtime_stats.cpp
  - gcd_of_n_numbers.cpp
  - CMakeLists.txt
  - check_amicable_pair.cpp
  - extended_euclid_algorithm.cpp
  - README.md
  - primes_up_to_billion.cpp
  - fibonacci.cpp
  - power_for_huge_numbers.cpp
  - double_factorial.cpp
  - fibonacci_fast.cpp
  - fast_power.cpp
  - check_prime.cpp
  - prime_numbers.cpp
- .gitpod.dockerfile
- .gitignore
- .gitpod.yml
- .vscode
  - settings.json
- doc
- range_queries
  - fenwick_tree.cpp
  - segtree.cpp
  - mo.cpp

The Algorithms - C++ # {#mainpage}

GitHub repo size

Overview

The repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. The 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

The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++.
Well documented source code with detailed explanations provide a valuable resource for educators and students alike.
Each source code is atomic using STL classes and no external libraries are required for their compilation and execution. Thus the fundamentals of the algorithms can be studied in much depth.
Source codes are compiled and tested for every commit on the latest versions of three major operating systems viz., Windows, MacOS and Ubuntu (Linux) using MSVC 16 2019, AppleClang 11.0 and GNU 7.5.0 respectively.
Strict adherence to C++11 standard ensures portability of code to embedded systems as well like ESP32, ARM Cortex, etc. with little to no changes.
Self-checks within programs ensure correct implementations with confidence.
Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.

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.