给你两个函数:
## 插入排序
def insertion_sort(sort_list):
iter_len = len(sort_list)
if iter_len < 2:
return sort_list
for i in range(1, iter_len):
key = sort_list[i]
j = i - 1
while j>=0 and sort_list[j]>key:
sort_list[j+1] = sort_list[j]
j -= 1
sort_list[j+1] = key
return sort_list
## 计算两点之间的距离
def GetDistance(fPoint1,fPoint2):
x1=fPoint1.X
y1=fPoint1.Y
x2=fPoint2.X
y2=fPoint2.Y
return pow((x1-x2),2)+pow((y1-y2),2)