如何根据注释完成要求 python

请问如何完成注释上的要求 自己写怎么改都有问题🥲谢谢🙏python

def bubblesort(arr):
    n = len(arr)
    for i in range(n-1):
        for j in range(n-1-i):
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr

def max_pairwise_distance(X):
    res, size = [], len(X)
    for i in range(size-1):
        for j in range(i+1, size):
            res.append(((X[i][0]-X[j][0])**2 + (X[i][1]-X[j][1])**2)**0.5)
    return bubblesort(res)[-1]

if __name__ == "__main__":
    X = [[3,4], [0,0], [-5,12]]
    print(max_pairwise_distance(X))

    X = [[1,4],[5,8],[9,2],[10,7]]
    print(max_pairwise_distance(X))

输出：
13.0
9.486832980505138

import math
def bubblesort(arr):
    n = len(arr)
    for i in range(n-1):
        for j in range(0,n-i-1):
            if arr[j]>arr[n-i-1]:
                arr[n-i-1],arr[j] = arr[j],arr[n-i-1]
    return arr

def max_parewise_distance(X):
    distance = []
    for item in X:
        distance.append(math.sqrt(item[0]**2 + item[1]**2))
    distance = bubblesort(distance)
    return distance
X = [[1,4],[5,8],[9,2],[10,7]]
distance = max_parewise_distance(X)
print(distance)

文字代码能发下吗？

def bubblesort(arr):
    n = len(arr)
    for i in range(n-1):
        for j in range(0,n-i-1):
            if arr[j]>arr[j+1]:
                arr[j],arr[j+1] = arr[j+1],arr[j]
    return arr

def max_parewise_distance(X):
    res = list(map(lambda x: (x[0] **2 + x[1] **2) **0.5, X))
    return bubblesort(res)[-1]

X = [[1,4],[5,8],[9,2],[10,7]]
d = max_parewise_distance(X)
print(d)

# Python program for implementation of Bubble Sort
 
def bubbleSort(arr):
    n = len(arr)
    # optimize code, so if the array is already sorted, it doesn't need
    # to go through the entire process
    swapped = False
    # Traverse through all array elements
    for i in range(n-1):
        # range(n) also work but outer loop will
        # repeat one time more than needed.
        # Last i elements are already in place
        for j in range(0, n-i-1):
 
            # traverse the array from 0 to n-i-1
            # Swap if the element found is greater
            # than the next element
            if arr[j] > arr[j + 1]:
                swapped = True
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
         
        if not swapped:
            # if we haven't needed to make a single swap, we
            # can just exit the main loop.
            return
 
 
# Driver code to test above
arr = [64, 34, 25, 12, 22, 11, 90]
 
bubbleSort(arr)
 
print("Sorted array is:")
for i in range(len(arr)):
    print("% d" % arr[i], end=" ")