Algorithms-and-Data-Structures

Discrete Analysis course in Moscow Aviation Institute

Вопросы: Vk, Telegram

1. Linear-Time Sorting: Radix Sort
2. Trees: Сompact Prefix Tree
3. Diagnosing, debugging: Valgrind (memcheck, callgrind, kcachegrind), Heaptrack, Gcov & Lcov, perf
4. String-searching algorithms: Boyer–Moore string-search algorithm