Standard-algorithms-in-C++

All the standard but taking longer code algorithms used for competitive programming.

Name		Name	Last commit message	Last commit date
Latest commit History 12 Commits
.gitattributes		.gitattributes
.gitignore		.gitignore
2d_segment_tree.cpp		2d_segment_tree.cpp
DSU (rank and path compression).cpp		DSU (rank and path compression).cpp
Dinic2.cpp		Dinic2.cpp
Dinic_max_flow.cpp		Dinic_max_flow.cpp
FFT.cpp		FFT.cpp
FHWT (fast hadmond walsh transform).cpp		FHWT (fast hadmond walsh transform).cpp
Fenwick tree (Binary_indexed_tree0.cpp		Fenwick tree (Binary_indexed_tree0.cpp
Ford_Fulkersons.cpp		Ford_Fulkersons.cpp
Hash_string.cpp		Hash_string.cpp
Heavy_light_decomposition.cpp		Heavy_light_decomposition.cpp
KMP.cpp		KMP.cpp
Karatsuba.cpp		Karatsuba.cpp
Lagrange_interpolation.cpp		Lagrange_interpolation.cpp
Lazy_propagation_segtree.cpp		Lazy_propagation_segtree.cpp
Lca_using_binaryjump.cpp		Lca_using_binaryjump.cpp
MO's_algortihm.cpp		MO's_algortihm.cpp
Matrix_expo.cpp		Matrix_expo.cpp
Max subsegment.cpp		Max subsegment.cpp
Max_area_triangle.cpp		Max_area_triangle.cpp
Max_bp_matching.cpp		Max_bp_matching.cpp
Mergesort_tree.cpp		Mergesort_tree.cpp
NTT.cpp		NTT.cpp
Persistant_segtree.cpp		Persistant_segtree.cpp
Push Relabel.cpp		Push Relabel.cpp
Push Relabel_FIFO.cpp		Push Relabel_FIFO.cpp
README.md		README.md
Segment_tree.cpp		Segment_tree.cpp
Suffix_array.cpp		Suffix_array.cpp
Treap sort tree.cpp		Treap sort tree.cpp
Treap.cpp		Treap.cpp
Trie.cpp		Trie.cpp
centroid_decomposition.cpp		centroid_decomposition.cpp
convex_hull.cpp		convex_hull.cpp
dp_convex_optimization.cpp		dp_convex_optimization.cpp
geometry.cpp		geometry.cpp
hashing.cpp		hashing.cpp
suffix_array.cpp		suffix_array.cpp
wavelet_tree.cpp		wavelet_tree.cpp

shubhamugare/Standard-algo-in-CPP

Folders and files

Latest commit

History

Repository files navigation

Standard-algorithms-in-C++

About

Resources

Stars

Watchers

Forks

Languages