GitHub - odhyan/algorithms: Quick implementation of some algorithms

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
README		README
articulation.cpp		articulation.cpp
avl.cpp		avl.cpp
bigproduct.cpp		bigproduct.cpp
bst_kth.cpp		bst_kth.cpp
closest_pair1.cpp		closest_pair1.cpp
closest_pair2.cpp		closest_pair2.cpp
edit_distance.cpp		edit_distance.cpp
infix2postfix.cpp		infix2postfix.cpp
knapsack.cpp		knapsack.cpp
kruskal.cpp		kruskal.cpp
lca.cpp		lca.cpp
lcs.cpp		lcs.cpp
max_subarray.cpp		max_subarray.cpp
max_submatrix.cpp		max_submatrix.cpp
n-queen.cpp		n-queen.cpp
overlapping_areas.cpp		overlapping_areas.cpp
repeated_numbers.cpp		repeated_numbers.cpp
scc.cpp		scc.cpp
sudoku.cpp		sudoku.cpp
sum.cpp		sum.cpp

Repository files navigation

Quick implementation of some algorithms.
Most of these were written for programming contests during college so these might not be the best implementations and are not recommended for practical purposes.