python可视化排序算法（完结）& 6种排序算法讲解！

Tan_Zhixia

已于 2024-09-21 18:56:24 修改

阅读量499

点赞数 7

CC 4.0 BY-SA版权

文章标签： pygame 排序算法算法

于 2024-09-21 18:52:50 首次发布

本文链接：https://blog.youkuaiyun.com/Tan_Zhixia/article/details/142421435

项目介绍

一共有6种排序算法

冒泡排序、快速排序、归并排序、插入排序、选择排序、和计数排序（最快！）

使用的时候把函数注释去掉使用

有红线标识

速度在函数内sleep函数内调节

非常实用！

代码

import pygame
import sys
from pygame.locals import *
from random import shuffle
from time import sleep
sys.setrecursionlimit(1000000000)
pygame.init()
screen = pygame.display.set_mode((1200,600))
def showList(myList,redList = []):
    screen.fill(Color(0,0,0))
    for i in range(200):
        k = 1200 / 201 * (i + 1)
        screen.fill(Color(255,255,255),Rect(k + 0.5,600 - myList[i] * 2,1200 / 201 - 1,myList[i] * 2))
    if redList != []:
        for i in redList:
            k = 1200 / 201 * (i + 1)
            screen.fill(Color(255,0,0),Rect(k + 0.5,600 - myList[i] * 2,1200 / 201 - 1,myList[i] * 2))
    pygame.display.update()
x = list(range(1,201))
x = x[::-1]
shuffle(x)
def mao_pao(num_list):
    num_len = len(num_list)
    for j in range(num_len):
        #sign = False
        for i in range(num_len - 1 - j):
            if x[i] > x[i+1]:
                x[i],x[i + 1] = x[i + 1],x[i]
                showList(x,[i,i + 1])  
            else:
                showList(x,[i,i + 1])
                #sign = True
            #if not sign:
                #break
    showList(x)
def quicksort(l,r):
    m = x[(l + r) // 2]
    i = l
    j = r
    while (i <= j):
        while (x[i] < m):
            i += 1
        while (x[j] > m):
            j -= 1
        if (i <= j):
            x[i],x[j] = x[j],x[i]
            sleep(0.01)
            showList(x,[i,j])
            i += 1
            j -= 1
    if (l < j):
        quicksort(l,j)
    if (i < r):
        quicksort(i,r)
    showList(x)
def merge(a,b):
    pl = 0
    pr = 0
    len_a = len(a)
    len_b = len(b)
    t = []
    while pl < len_a and pr < len_b:
        if a[pl] <= b[pr]:
            t += [a[pl]]
            pl += 1
        else:
            t += [b[pr]]
            pr += 1
        showList(x,[x.index(a[pl - 1]),x.index(b[pr - 1])])
        sleep(0.002)
    if pl < len_a:
        t += a[pl:]
        showList(x,[x.index(a[pl - 1])])
        sleep(0.002)
    if pr < len_b:
        t += b[pr:]
        showList(x,[x.index(b[pr - 1])])
        sleep(0.002)
    return t
def mergeSort(l,r):
    if l == r:
        return
    mid = (l + r) // 2
    mergeSort(l,mid)
    mergeSort(mid + 1,r)
    t = merge(x[l:mid + 1],x[mid + 1:r + 1])
    n = l
    for i in t:
        x[n] = i
        showList(x,[n])
        n += 1
        sleep(0.002)
def selectSort():
    length = len(x)
    if length <= 1:
        return x
    for j in range(length):
        min_num_index = j
        for i in range(j+1, length):
            if x[i] < x[min_num_index]:
                min_num_index = i
                showList(x,[min_num_index,j,i])
        x[min_num_index], x[j] = x[j], x[min_num_index]
        showList(x,[min_num_index,j,i])
        sleep(0.02)
def insertionSort():
    for i in range(200):
        cur_index = i
        while x[cur_index - 1] > x[cur_index] and cur_index - 1 >= 0:
            x[cur_index],x[cur_index - 1] = x[cur_index - 1],x[cur_index]
            showList(x,[cur_index,cur_index - 1,i])
            cur_index -= 1
            sleep(0.002)
def countingSort():
    t = [0] * 200
    for i in x:
        t[i - 1] += 1
        showList(x,[i - 1])
        sleep(0.002)
    num = 0
    for i in range(200):
        while t[i] > 0:
            x[num] = i
            showList(x,[num,i])
            num += 1
            t[i] -= 1
#mao_pao(x)
#quicksort(0,199)
#mergeSort(0,199)
#selectSort()
#insertionSort()
#countingSort()
while True:
    showList(x)
    for event in pygame.event.get():
        if event.type == QUIT:
            exit()