A hands-on analysis of common recursive and iterative algorithms with empirical timing and memory profiling. The project implements Fibonacci (naïve recursive and DP), Merge Sort, Quick Sort, ...