Comparing Brute Force and Divide and Conquer for Solving Closest Pair Problem | CSCE 350, Study Guides, Projects, Research of Computer Science

Download Comparing Brute Force and Divide and Conquer for Solving Closest Pair Problem | CSCE 350 and more Study Guides, Projects, Research Computer Science in PDF only on Docsity! CSCE 350 – Data Structures and Algorithms Summer 2008 – Project Topic 4 Comparing Brute Force and Divide-and-Conquer for solving Closest-Pair Problem 1. Implements and compares algorithms for solving Closest-Pair problem using Brute-Force and Divide-and-Conquer strategies. 2. Given a list P of 20 points in the plan P1=(x1, y1)… Pn=(xn, yn), your program should be able to find the indexes of the closest pair of points. 3. Your program should be able to read a file containing at least 20 lines. Each line is a pair of x, y coordinates for each point in the plan. 4. Prepare a written report that shows your comparison results and efficiency analysis. 5. For your in-class presentation, you need to present your algorithms and their efficiency analysis. You also need to present your results and explain whether your results are consistent with the theoretical analysis. General Guidelines for Programming Projects  Please follow the guidelines below carefully. You will not receive full credit unless you follow the instructions.  Write your code in C or C++ to run on the department’s Linux lab machines.  Document your code so that it can be read and understood by another human being. Remove any commented-out portions of your code and any debugging outputs.  Using the dropbox on the CSE department’s secure web server (https://www.cse.sc.edu/) to submit your work: o All source code, makefile, etc. needed to recompile your program. o The data files you used to test the program. o A Linux executable generated from this source code. o A short README text file describing how to compile and run your program.