Algorithms

This is a collection of some of the algorithms i use in problem solving.

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
BIT_REVISITED.cpp		BIT_REVISITED.cpp
Dijakastra.cpp		Dijakastra.cpp
Floyd_Warshal.cpp		Floyd_Warshal.cpp
LCA_NlogN.cpp		LCA_NlogN.cpp
LCS_revisited.cpp		LCS_revisited.cpp
Linear_Sieve.cpp		Linear_Sieve.cpp
MATRIX_EXPO.cpp		MATRIX_EXPO.cpp
Merge_sort_revisted.cpp		Merge_sort_revisted.cpp
Minimum_Spanning_tree(KRUSKAL).cpp		Minimum_Spanning_tree(KRUSKAL).cpp
Minimum_Spanning_tree(PRIMS).cpp		Minimum_Spanning_tree(PRIMS).cpp
NOD.cpp		NOD.cpp
Number_of_fact_with_base_conversion.cpp		Number_of_fact_with_base_conversion.cpp
Prime_factorization.cpp		Prime_factorization.cpp
Prime_factorization_of_factorial.cpp		Prime_factorization_of_factorial.cpp
README.md		README.md
Segment_tree.cpp		Segment_tree.cpp
Segment_tree_lazy_with_propagation.cpp		Segment_tree_lazy_with_propagation.cpp
Segmented_sieve.cpp		Segmented_sieve.cpp
Strongly_Connected_Component(SCC).cpp		Strongly_Connected_Component(SCC).cpp
Topological_Sort_MY.cpp		Topological_Sort_MY.cpp
Trie_Data_Structure.cpp		Trie_Data_Structure.cpp
bfs_in_2d.cpp		bfs_in_2d.cpp
bigmod.cpp		bigmod.cpp
coin_change.cpp		coin_change.cpp
coin_change_dp.cpp		coin_change_dp.cpp
connected_components.cpp		connected_components.cpp
disjoint_set.cpp		disjoint_set.cpp
euler_phi.cpp		euler_phi.cpp
ext_euclid.cpp		ext_euclid.cpp
flood_fill.cpp		flood_fill.cpp
knapsack_Ag9.cpp		knapsack_Ag9.cpp
maximum_subArray.cpp		maximum_subArray.cpp
sieve_modified.cpp		sieve_modified.cpp

Provide feedback