CS 325 Assignments Assignment 1 Implement three algorithms (bruteforce, and two divide and conquer) for calculating the closest pair given a set of coordinates. Assignment 2 Implement a dynamic programming algorithm for the edit distance problem.