Allow the user to enter multiple pairs of x and y coordinates on a 2 dimensional graph (these numbers may be considered unitless) along with a text label for that set of points. You must use a "struct" data type to define how these are stored. - The x and y coordinates should be type "float" or "double" - Allow multiple data points to be entered by the user, so the first thing the user must ask is how many coordinates will be entered. Since multiple entries will be made you must create an array of that "struct" type. - Once all of the coordinates and labels are entered, calculate the distance between each set of points (you DO NOT have to store all of the distances!!!). In this lab you may use "math.h" (it may be useful). - Determine which coordinates are closest to each other out of all of the pairs. - Determine which coordinates are furthest from each other out of all of the pairs. NOTE!!!! There will be a 10 point value for efficiency. Please contemplate the BEST way to do this MOST efficiently. Brute-force is fine, but do better somehow!!! - Output the text label, and their corresponding relative distances, for the two closest coordinates and two most distant coordinates (if there is a tie, it is OK to report the last one with the "Winning" proximities...no need to report both or all of them....however, if you would like to handle ties it may be a fun exercise) 1. users must enter positive coordinates for both x and y and, of course, they must be actual numbers 2. a text label must be entered for each set of coordinates and the label CANNOT be used more than once (although a pair of coordinates CAN be used more than once!!!) 3. the user must declare that they intend to enter more than 1 set of coordinates (if they don't, there's not much use for this program)
MUST BE DONE IN C
- Allow the user to enter multiple pairs of x and y coordinates on a 2 dimensional graph (these numbers may be considered unitless) along with a text label for that set of points. You must use a "struct" data type to define how these are stored.
- The x and y coordinates should be type "float" or "double"
- Allow multiple data points to be entered by the user, so the first thing the user must ask is how many coordinates will be entered. Since multiple entries will be made you must create an array of that "struct" type.
- Once all of the coordinates and labels are entered, calculate the distance between each set of points (you DO NOT have to store all of the distances!!!). In this lab you may use "math.h" (it may be useful).
- Determine which coordinates are closest to each other out of all of the pairs.
- Determine which coordinates are furthest from each other out of all of the pairs.
NOTE!!!! There will be a 10 point value for efficiency. Please contemplate the BEST way to do this MOST efficiently. Brute-force is fine, but do better somehow!!!
- Output the text label, and their corresponding relative distances, for the two closest coordinates and two most distant coordinates (if there is a tie, it is OK to report the last one with the "Winning" proximities...no need to report both or all of them....however, if you would like to handle ties it may be a fun exercise)
1. users must enter positive coordinates for both x and y and, of course, they must be actual numbers
2. a text label must be entered for each set of coordinates and the label CANNOT be used more than once (although a pair of coordinates CAN be used more than once!!!)
3. the user must declare that they intend to enter more than 1 set of coordinates (if they don't, there's not much use for this program)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
