为什么升序地理距离排序比降序地理距离排序快

import math

def distance(point1, point2):
    return math.sqrt((point1[0] - point2[0]) ** 2 + (point1[1] - point2[1]) ** 2)

def quicksort(points, low, high):
    if low < high:
        pi = partition(points, low, high)
        quicksort(points, low, pi - 1)
        quicksort(points, pi + 1, high)

def partition(points, low, high):
    pivot = points[high]
    i = low - 1
    for j in range(low, high):
        if distance(points[j], pivot) < distance(pivot, pivot):
            i += 1
            points[i], points[j] = points[j], points[i]
    points[i + 1], points[high] = points[high], points[i + 1]
    return i + 1

# 示例数据
points = [(1, 2), (3, 4), (5, 6), (7, 8)]
quicksort(points, 0, len(points) - 1)
print(points)