0
I have a 2-dimensional array like this:
{1,3,5,6,2,2}
{6,2,4,7,2,1}
{17,28,32,1,35,45}
...
I have a function that can calculate the euclidean distance between any two arrays. Assuming that the distance function operates correctly, what's the best way to sort the 2-dimensional array so that...