Divide and Conquer Algorithms

Overview

This project implements classic divide-and-conquer algorithms in Java:

• MergeSort
• QuickSort
• Deterministic Select (Median-of-Medians)
• Closest Pair of Points

Learning Goals

• Implement algorithms with safe recursion
• Analyze time complexity (Master theorem, Akra–Bazzi)
• Collect and visualize performance metrics
• Practice clean GitHub workflow with feature branches

How to build & test

mvn clean package
mvn test