The user will give you n arrays of size m (all arrays have the same size)....

Transcribed Image Text:

The user will give you n arrays of size m (all arrays have the same size). You will create a function to calculate the Euclidean distance for each of the n arrays. Then, in another function whose arguments are the distances, you will compare all the Euclidean distances and print the greatest one. Hint: you should store the distances in another array. Euclidean distance array {3, 4} --> 3 + 4 = 5 Array {3, 4, 12} --> 3 + 4 + 12 = 13 (base) sebasjr@sebasjr-ubuntu:~$ ./a.out insert the number of arrays: 4 insert the the size of the arrays: 2 insert array: 11 insert array: 3 4 insert array: 12 5 insert array: 24 7 the maximum distance is: 25.000000 The user will give you n arrays of size m (all arrays have the same size). You will create a function to calculate the Euclidean distance for each of the n arrays. Then, in another function whose arguments are the distances, you will compare all the Euclidean distances and print the greatest one. Hint: you should store the distances in another array. Euclidean distance array {3, 4} --> 3 + 4 = 5 Array {3, 4, 12} --> 3 + 4 + 12 = 13 (base) sebasjr@sebasjr-ubuntu:~$ ./a.out insert the number of arrays: 4 insert the the size of the arrays: 2 insert array: 11 insert array: 3 4 insert array: 12 5 insert array: 24 7 the maximum distance is: 25.000000