# /usr/bin/python
# -*- coding:utf-8 -*-
Sample = [72, 6, 57, 88, 120, 60, 42, 83, 73, 48, 85, 100, 201, 119]
L = len(Sample) - 1
B = 0
def Quicksort(sample, b, r):
if b >= r:
return
i = b
j = r
key = sample[b]
while i < j:
while (i < j) and (sample[j] >= key):
j -= 1
if i < j:
sample[i] = sample[j]
i += 1
while (i < j) and (sample[i] < key):
i += 1
if i < j:
sample[j] = sample[i]
j -= 1
#i == j
sample[i] = key
Quicksort(sample, 0, i - 1)
Quicksort(sample, i + 1, r)
Quicksort(Sample, B, L)
print (Sample)
初学Python:快速排序-Quicksort
最新推荐文章于 2022-08-29 18:23:23 发布