Algorithms and Data Structures

Collection of projects focused on implementation and performance analysis of fundamental algorithms.

Scope

• Graph algorithms:

  • DFS (Depth-First Search)
  • Dijkstra
  • Bellman-Ford

• Sorting algorithms:

  • Multiple sorting methods with performance comparison
  • Parallel Merge Sort implementation

• Data structures:

  • Graph representations (adjacency matrix, adjacency list)

Features

• Performance benchmarking for different input sizes and scenarios
• Comparison between sequential and parallel algorithms
• Analysis of theoretical vs practical complexity

Results

• Adjacency matrix performs better for dense graphs
• Adjacency list is more efficient for sparse graphs
• Parallel merge sort improves performance on large datasets

Tech

• C++ (including multithreading)

Status

Academic projects