Python技术知识库

def quick_sort(arr):
    """快速排序算法实现"""
    if len(arr) <= 1:
        return arr
    
    # 选择中间元素作为基准
    pivot = arr[len(arr) // 2]
    
    # 分区操作
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    
    # 递归排序并合并结果
    return quick_sort(left) + middle + quick_sort(right)

# 测试快速排序
if __name__ == "__main__":
    # 测试数据
    test_data = [64, 34, 25, 12, 22, 11, 90]
    print("原始数组:", test_data)
    
    sorted_data = quick_sort(test_data)
    print("排序后数组:", sorted_data)
    
    # 验证排序结果
    assert sorted_data == [11, 12, 22, 25, 34, 64, 90]
    print("排序结果验证通过!")