#Algorithms
My implementations of some algorithms. Some practice before I take over the Universe.
##Usage The files have a sample set of input and output at the top, and possibly comments regarding the implementation.
If the math libraries don't link properly, try using the -lm flag.
e.g.:
gcc -o dfs -lm dfs.c
./dfs < dfs_inp
##Algorithms implemented so far
- Depth-first search
- Breadth-first search
- Disjoint Sets
- Longest Common Subsequence
- Longest Increasing Subsequence
- Knuth-Morris-Pratt
- Sieve of Eratosthenes
- 0-1 Knapsack
- Segment Tree
- Floyd-Warshall
- Kruskal's Minimum Spanning Tree
- Quicksort
- Heapsort
##Feedback For pointing out any mistakes, suggesting changes or communication anything else, get in touch at [email protected]