【python 数据结构 1：排序】冒泡排序和快速排序

来源：互联网发布：蜂群算法中的fit函数编辑：程序博客网时间：2024/05/16 18:41

功能：用python实现冒泡排序和快速排序，并且进行简单测试。

<span style="font-size:18px;">#!/bin/env python#-*- coding:utf8 -*-import randomimport datetimeimport copy#快速排序def quicksort(data, low = 0, high = None):        if high == None:                high = len(data) - 1        if low < high:                s, i, j = data[low], low, high                while i < j:                        while i < j and data[j] >= s:                                j = j - 1                        if i < j:                                data[i] = data[j]                                i = i + 1                        while i < j and data[i] <= s:                                i = i + 1                        if i < j:                                data[j] = data[i]                                j = j - 1                data[i] = s                quicksort(data, low, i - 1)                quicksort(data, i + 1, high)#冒泡排序               def bubblesort(data):        for i in range(len(data) - 1, 1, -1):                for j in range(0, i):                        if data[j] > data[j + 1]:                                data[j], data[j + 1] = data[j + 1], data[j]#性能测试def sort_perfmon(sortfunc, data):        sort_data = copy.deepcopy(data)        t1 = datetime.datetime.now()        sortfunc(sort_data)        t2 = datetime.datetime.now()        print sortfunc.__name__, t2 - t1        #print sort_data#定义一个随机数组data = [random.randint(0, 65536) for i in range(2000)]#print data sort_perfmon(quicksort, data)sort_perfmon(bubblesort, data)</span>

0 0