DORIANFLORESCU
📊
Computer Science Course

CMSC451

Design and Analysis of Computer Algorithms

Focuses on algorithm design techniques, complexity analysis, and computational efficiency. Covers sorting, searching, graph algorithms, dynamic programming, and NP-completeness.

Course Projects

Sorting Algorithm Benchmarker code snippet
Java

Sorting Algorithm Benchmarker

Tool for benchmarking and comparing the performance of iterative and recursive implementations of sorting algorithms.

Project 1
Graph Algorithm Visualizer code snippet
Java

Graph Algorithm Visualizer

Interactive visualization of common graph algorithms with performance analysis.

Project 2
Dynamic Programming Solutions code snippet
Java

Dynamic Programming Solutions

Implementation of various dynamic programming algorithms for optimization problems.

Project 3
Complexity Analyzer code snippet
Java

Complexity Analyzer

Tool for analyzing and visualizing the time and space complexity of algorithms.

Project 4