Question: #1[a] Design a brute-force algorithm for finding the two closest points from a set of n points in 3-dimensional space. 2 pts #1[b] Determine the
#1[a] Design a brute-force algorithm for finding the two closest points from a set of n points in 3-dimensional space.
2 pts
#1[b] Determine the efficiency class of your algorithm.
2 pts
#1[c] Implement your algorithm in Java. Your program should prompt the user for the number of points n, where n > 2, and the coordinates of each point. Your program should store the points in a 2D array. Assume a maximum of 25 points will be entered. Your program should display the coordinates of all the points. Finally, your program should output the coordinates of the two closest points.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
