the description of the program is more descriptive on For this program you will be writing a simplified version of an algorithm which is occasionally used in Artifical Intelligence programs called Nearest Neighbor. What you will basically be doing is calculating the distance between a set of user entered points and each set of points from the data files you created in Program #8. The results of the calculations and the identification of which point is closest to the user entered point will all be written out to a results file. To calculate the distance between the points you should use an expanded version of the distance formula. Since you are dealing with 5 points, you should expand the formula out to accept 5 points. Notes and Hints: * You may use the string type for the file names. Refer to examples on the web page for the proper way of using c_str() to pass the correct parameter type when opening the files. * To get the entries in the table to line up correctly, you'll need to use setw() from . Refer to sectin 5.5 starting on page 252 for pamameters and usage. * Use the math library functions pow and sqrt. See the appendix on page 856-857 for usages. * Your output/results file should present the data in a clear and concise manner. See the sample output for an example of how it should be set up. Sample run: [url removed, login to view]: g++ -Wall [url removed, login to view] [url removed, login to view]: [url removed, login to view] Enter the input filename: [url removed, login to view] Enter the output filename: [url removed, login to view] Enter your Five test data points seperated by a space: 12 14 13 8 11 Processing input from: [url removed, login to view] Please wait ..... Processing done. Results left in: [url removed, login to view] Bye. If you were then to examine the file [url removed, login to view], it would look something like this: [url removed, login to view]: cat [url removed, login to view] Point 1 User Point 2 Distance _______ ____________ ________ 1.) ( 1, 7, 9, 9, 22) to (12, 14, 13, 8, 11) = 17.5499 2.) ( 4, 3, 11, 14, 8) to (12, 14, 13, 8, 11) = 15.2971 3.) ( 0, 21, 12, 13, 8) to (12, 14, 13, 8, 11) = 15.0997 4.) ( 6, 8, 6, 19, 10) to (12, 14, 13, 8, 11) = 15.5885 5.) ( 0, 15, 24, 11, 4) to (12, 14, 13, 8, 11) = 18 ============================================================= The closest point is: 3.) 0 21 12 13 8 at distance: 15.0997
I i understand file i/o and all that. the only thing i'm having a problem with is recursion(and my busy schedule). if you can write a program like the one in the drescription, great, i'll use it for reference and help me do the assignment. I attached a file([url removed, login to view]), which is a text file you'll be using to read the numbers from. Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
## Deadline information
Would prefer to have it by sunday .I'm a hour behind GMT time.