#!/usr/bin/env python3
# -*- coding:utf-8 -*-
import random
#快速排序基础
def PARTITION(A, p, r):
x = A[r]
i = p - 1;
j = p
while(j < r):
if (A[j] < x):
i += 1
temp = A[i]
A[i] = A[j]
A[j] = temp
j += 1
i += 1
temp = A[i]
A[i] = A[r]
A[r] = temp
return i
快速排序的实现(python)
最新推荐文章于 2023-05-23 17:57:12 发布