Python快速排序算法

# -*- coding: utf-8 -*-
# 快速排序算法
import random

fenshu = int(input("请输入考试满分："));
renshu = int(input("请输入考试人数："));
sortsre = input("倒叙/正序 请选择 Y/N：");
while sortsre!="Y" and sortsre!="N":
    print("您输入的参数有误！");
    sortsre = input("倒叙/正序 请选择 Y/N：");

classmates = [0]*(renshu);

#模拟数据生成
for num in range(renshu):
    shu = random.randint(0,fenshu);
    classmates[num] = shu;
    print("%d分" % (shu));

print("");
print("");

#重组数据
def fangfa(left,right):
    if left>right:
        return;
    jizhunshu = classmates[left];
    i = left;
    j = right;
    if sortsre=="N":
        while i!=j:
            while (classmates[j]>=jizhunshu) and (i<j):
                j-=1;
            while (classmates[i]<=jizhunshu) and (i<j):
                i+=1;
            if i<j:
                t=classmates[i];
                classmates[i]=classmates[j];
                classmates[j]=t;
    elif sortsre=="Y":
        while i!=j:
            while (classmates[j]<=jizhunshu) and (i<j):
                j-=1;
            while (classmates[i]>=jizhunshu) and (i<j):
                i+=1;
            if i<j:
                t=classmates[i];
                classmates[i]=classmates[j];
                classmates[j]=t;
    classmates[left] = classmates[i];
    classmates[i] = jizhunshu;
    fangfa(left,i-1);
    fangfa(i+1,right);
#递归方法
fangfa(0,len(classmates)-1);
#打印数据
for num in classmates:
    print("%d分" % (num));