python--排序

#!/usr/bin/env python
# -*- coding:utf-8 -*- 
# author:love_cat

def sift(li,low,high):
    i = low
    j = 2 * i + 1

    while j <= high:
        if j+1 <= high and li[j] < li[j+1]:
            j += 1
        if li[j] > li[i]:
            li[j],li[i] = li[i],li[j]
            i = j
            j = 2 * i + 1
        else:
            break

def heap_sort(li):
    n = len(li)
    for i in range(n // 2 - 1,-1,-1):
        sift(li,i,n - 1)

    for i in range(n-1,-1,-1):
        li[0],li[i] = li[i],li[0]
        sift(li,0,i-1)

import random
li = list(range(30))
random.shuffle(li)
print(li)
heap_sort(li)
print(li)
# 输出结果
‘‘‘
[7, 27, 9, 18, 20, 13, 6, 23, 3, 12, 5, 11, 2, 1, 28, 29, 0, 17, 26, 14, 8, 10, 4, 16, 15, 21, 22, 24, 19, 25]
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29]

‘‘‘

#!/usr/bin/env python
# -*- coding:utf-8 -*- 
# author:love_cat
import random
import time

def select_sort(li):
    for i in range(len(li)-1):
        min_index = i
        for j in range(i+1,len(li)):
            if li[j] < li[min_index]:
                li[j],li[min_index] = li[min_index],li[j]

li = list(range(30))
random.shuffle(li)
print(li)
start = time.time()
select_sort(li)
print(‘time:‘,time.time()-start)
print(li)
# 输出结果
‘‘‘
[29, 8, 20, 26, 9, 2, 27, 21, 1, 10, 18, 11, 12, 0, 25, 6, 16, 23, 17, 13, 22, 3, 24, 7, 14, 19, 4, 5, 15, 28]
time: 0.0
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29]

‘‘‘

#!/usr/bin/env python
# -*- coding:utf-8 -*- 
# author:love_cat

def quick_sort(li,left,right):
    if left < right:
        mid = partition(li,left,right)
        quick_sort(li,left,mid-1)
        quick_sort(li,mid+1,right)

def partition(li,left,right):
    temp = li[left]
    while left < right:
        while left < right and li[right] >= temp:
            right -= 1
        li[left] = li[right]
        while left < right and li[left] <= temp:
            left += 1
        li[right] = li[left]
    li[left] = temp
    return left

li = list(range(30))
import random
random.shuffle(li)
print(li)
quick_sort(li,0,len(li)-1)
print(li)
# 输出结果
‘‘‘
[0, 16, 21, 24, 2, 22, 19, 10, 5, 28, 25, 13, 18, 26, 29, 9, 23, 14, 7, 3, 17, 8, 11, 15, 6, 1, 4, 27, 20, 12]
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29]

‘‘‘

#!/usr/bin/env python
# -*- coding:utf-8 -*- 
# author:love_cat
def merge(li,low,mid,high):
    i = low
    j = mid+1
    ltemp = []
    while i <= mid and j <= high:
        if li[i] < li[j]:
            ltemp.append(li[i])
            i += 1
        else:
            ltemp.append(li[j])
            j += 1
    while i <= mid:
        ltemp.append(li[i])
        i += 1
    while j <= high:
        ltemp.append(li[j])
        j += 1
    li[low:high+1] = ltemp
def merge_sort(li,low,high):
    if low < high:
        mid = (low + high) // 2
        merge_sort(li,low,mid)
        merge_sort(li,mid+1,high)
        merge(li,low,mid,high)

li = list(range(30))
import random
random.shuffle(li)
print(li)
merge_sort(li, 0, len(li)-1)
print(li)
# 输出结果
‘‘‘
[29, 27, 22, 5, 10, 8, 16, 25, 0, 20, 1, 14, 12, 28, 11, 19, 7, 4, 3, 18, 15, 6, 26, 17, 21, 9, 13, 24, 23, 2]
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29]
‘‘‘

#!/usr/bin/env python
# -*- coding:utf-8 -*- 
# author:love_cat
import random

def insert_sort(li):
    for i in range(len(li)-1):

        j = i + 1
        while j >0 and li[j]<li[j-1]:
            li[j],li[j-1] = li[j-1],li[j]
            j -= 1

li = list(range(30))
random.shuffle(li)
print(li)
insert_sort(li)
print(li)
# 输出结果
‘‘‘
[6, 9, 0, 26, 21, 7, 1, 11, 4, 10, 14, 20, 29, 5, 8, 3, 23, 18, 17, 12, 24, 27, 25, 15, 2, 13, 22, 16, 28, 19]
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29]

‘‘‘

#!/usr/bin/env python
# -*- coding:utf-8 -*- 
# author:love_cat

def sift(li,low,high):
    i = low
    j = 2 * i + 1

    while j <= high:
        if j+1 <= high and li[j] < li[j+1]:
            j += 1
        if li[j] > li[i]:
            li[j],li[i] = li[i],li[j]
            i = j
            j = 2 * i + 1
        else:
            break

def heap_sort(li):
    n = len(li)
    for i in range(n // 2 - 1,-1,-1):
        sift(li,i,n - 1)

    for i in range(n-1,-1,-1):
        li[0],li[i] = li[i],li[0]
        sift(li,0,i-1)

import random
li = list(range(30))
random.shuffle(li)
print(li)
heap_sort(li)
print(li)
# 输出结果
‘‘‘
[7, 27, 9, 18, 20, 13, 6, 23, 3, 12, 5, 11, 2, 1, 28, 29, 0, 17, 26, 14, 8, 10, 4, 16, 15, 21, 22, 24, 19, 25]
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29]

‘‘‘