This is a collection of algorithms I implemented as an exam preparation (first semester course). All of this is written in Java. Next to some useful data structures, there are also some utility functions, especially for logging and debugging.
- Graph
- Node
- Stack
- Queue
- Min/Max Heap
- LAT (longest ascending subsequence)
- MED (minimum edit distance)
- LGT (longest common subsequence)
- subsetsum
- knapsack
- BFS (breadth-first search)
- DFS (depth-first search)
- binary search
- linear search
- exponential search
- bubble sort
- insertionsort
- selectionsort
- heapsort
- mergesort
- quicksort
