DAA Algorithm Visualizer

Divide and Conquer Algorithms Visualization

CS302 - Design and Analysis of Algorithms Project

Find the two closest points among n points in 2D space using divide and conquer approach

Complexity:O(n log n)

Multiply large integers efficiently using the Karatsuba algorithm

Complexity:O(n^1.585)

Compare algorithm performance across multiple test cases

Complexity:Performance Analysis

Team: Huzaifa Abdul Rehman, Abdul Moiz Hossain, Ajay Kumar

This project demonstrates the implementation and visualization of two fundamental divide-and-conquer algorithms:

Closest Pair of Points: Efficiently finds the two closest points in a 2D plane with O(n log n) time complexity.
Integer Multiplication (Karatsuba): Multiplies large integers faster than traditional methods with O(n^1.585) complexity.

Each algorithm includes interactive visualizations, performance metrics, and the ability to test with various input sizes from 100 to 1000 elements.