FilesExpand file tree

 master

/

InsertSort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

24 lines (19 loc) · 616 Bytes

 master

/

InsertSort.py

Copy path

Top

File metadata and controls

• Code
• Blame

24 lines (19 loc) · 616 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

# coding:utf8

"""

插入排序和冒泡排序的区别在于：

插入排序的前提是：左边是有序的数列

而冒泡排序：相邻的值进行交换，一共进行n次交换

"""

def insert_sort(l):

# 循环 除第一个数字组成的有序数组 以外的数字

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

# 每一个数字，依次和有序数组进行比较

print l[:i]

for j in range(len(l[:i])):

if l[i] < l[j]:

l[i], l[j] = l[j], l[i]

if __name__ == "__main__":

l = [5, 1, 9, 3, 2, 7]

print l

insert_sort(l)

print("result: " + str(l))