Data Structures and Algorithms course at Saratov State University, 4th semester

Main tasks

1. Sorts
   • Counting and Radix sorts
   • Quick, Merge and Heap sorts with time comparison
2. Data structures
   • Binary Search Tree
   • Red Black Tree
   • AVL Tree
3. String algorithms
   • Prefix- and Z-function (conversion from Z- to prefix-function and backwards was optional)
   • Knuth–Morris–Pratt algorithm
   • Boyer–Moore algorithm

Optional tasks

1. Kruskal algorithm with Disjoint Set Union
2. Rabin-Karp algorithm