Implement divide and conquer algorithms

Create implementations for divide and conquer algorithm patterns:

## Classic divide and conquer algorithms:
- Merge sort
- Quick sort
- Binary search
- Strassen's matrix multiplication
- Karatsuba's algorithm for multiplication
- Closest pair of points
- Convex hull

## Advanced applications:
- Fast Fourier Transform (FFT)
- Finding the median of two sorted arrays
- Count inversions in an array
- Maximum subarray sum
- Skyline problem
- Integer multiplication

## Requirements:
- Provide detailed recurrence relation analysis
- Include time and space complexity derivations
- Create visualization helpers
- Document practical applications

This collection will demonstrate the divide and conquer paradigm, showing how breaking problems into smaller subproblems can lead to efficient algorithms for a wide range of computational tasks.