Question

This is a python question

The distance between 2 points (xi.Vi). (x2.y2) on a plane is given by the following equation: Write a function named shortestDist that wil take a list of points as its only argument and return the shortest distance between any two points in the list. Each point in the list is represented by a list of two elements: Note that this will require an "all-pairs" comparison. Avoid comparing a point with itself?! Note: You may assume that we will only test your function with lists of length two or more, and that this list contains only lists of exactly two numeric values (integers or floats). Some samples are given below: >>>shortestDist ([[1,1], [2,21,14,4]]) 1.4142135623730951 >>shortestDist ([(45, -99, [24, 83], [-48, -68, -97, 99], [-8, 77], [-2, 50, [44, 41], [-48, -58], -1, 531, [14, 861, [31, 94, [12, -91], 33, 50], [82, 72, [83, -90], [10, 78, 7, -221], [90, -88, -21, 5], [6, 23]]) 3. 1622776601683795

Answer 1

CODE:

import math
anylist=[[1,1],[2,2],[4,4]] #input list
def shortestDist(anylist):
i=0
j=i+1
z=0
templist=[] #temporary list to store distances
while(z<len(anylist)-1):
sum1=(anylist[i][0]-anylist[j][0] )**2 + ( anylist[i][1]-anylist[j][1] )**2
i=i+1
j=i+1
z=z+1
templist.append(math.sqrt(sum1))
return templist
calling=shortestDist(anylist)
print(min(calling)) # printing minimum distance