ByTheMark demo exercises
These exercises demonstrate the content of the ByTheMark service. These are meant for private individuals for learning data structures and algorithms. If you want to try out more content, you can
register to the ByTheMark Personal free of charge.
Linear search
- Binary search
- Interpolation search
Recursive sorting methods
- Quicksort
- Radix-exchange-sort
- Mergesort (iterative)
- Mergesort (recursive)
Radix search trees and tries
- Digital Search Tree
- Radix Search Tree
- Trie
Graph algorithms
- BFS
- DFS
- Prim‘s algorithm
- Dijkstra‘s algorithm
- Dijkstra's algorithm with heap