This 28 algorithms were written as part of the Algorithms and Data Structures class at UMCS.
All of those provided had to pass tests by an algorithm checker.
Algorithms have been checked for correctness of results, speed of operation and memory consumption.
Example output:
Algorithmic problems solved required implementing solutions from areas such as:
- sorting,
- lists,
- trees,
- graphs,
- stack,
- queues,
- divide and conquer,
- greedy algorithms,
- dynamic programming,
- backtracking
- dijkstra
- prime
- bigraph (hopkroft-karp)
- binary search tree
- b tree
- red black tree
- rabin karp
- knuth morris pratt