python选择,冒泡,插叙排序方式

选择排序:

import random

def select_sort(li):

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

min_loc = i

for j in range (i+ 1 , len (li)):

if li[min_loc] > li[j]:

min_loc = j

if min_loc != i:

li[i] , li[min_loc] = li[min_loc] , li[i]

data = list ( range ( 1000 ))

random.shuffle(data)

select_sort(data)

print (data)

冒泡排序:

import random

# def bubble_sort(li):

# for i in range(len(li) - 1):

# for j in range(len(li) - i - 1):

# if li[j] > li[j+1]:

# li[j], li[j+1] = li[j+1], li[j]

def bubble_sort_1(li):

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

exchange = False

for j in range ( len (li) - i - 1 ):

if li[j] > li[j+ 1 ]:

li[j], li[j+ 1 ] = li[j+ 1 ], li[j]

exchange = True

if not exchange:

break

data = list ( range ( 1000 ))

random.shuffle(data)

# bubble_sort(data)

bubble_sort_1(data)

print (data)

插叙排序:

# import random

# def insert_sort(li):

# for i in range(1,len(li)):

# tmp = li[i]

# j = i - 1

# while j >= 0 and li[j] < tmp:

# li[j+1]=li[j]

# j = j - 1

# li[j+1] = tmp

#

# data = list(range(1000))

# random.shuffle(data)

# insert_sort(data)

# print(data)

num1 = [ 36 , 52 , 1 , 9 , 43 ]

for i in range ( 1 , len (num1)):

j = i - 1

if num1[i] < num1[j]:

temp = num1[i]

num1[i] = num1[j]

j = j - 1

while j >= 0 and temp < num1[j]:

num1[j+ 1 ] = num1[j]

j = j - 1

num1[j+ 1 ] = temp

print (num1)