Algorithm Analysis & Data Structure Experiments
Jun 1, 2025
·
1 min read
This repository is a collection of in-depth academic projects for an Advanced Data Structures course, focusing on the implementation and comparative analysis of complex algorithms.
Key Components
- BST Performance Analysis: Implemented and conducted experiments on various Binary Search Trees, including Splay Trees and Tango Trees, to analyze their performance bounds. Includes a full academic report.
- Streaming Algorithms Comparison: Implemented and benchmarked classic streaming algorithms in C++, including Morris, Flajolet-Martin (FM), and HyperLogLog (HLL), to evaluate their accuracy in cardinality estimation.
- DSU Theoretical Analysis: A theoretical paper analyzing a linear-time algorithm for a special case of the Disjoint Set Union (DSU) problem.
You can view the complete source code and all academic reports from the link below: