#! /usr/bin/python
#coding=utf-8
#插入排序
def insert_value_raise(value,array):
for index in range(len(array)):
if value<array[index]:
array.insert(index,value)
return
array.append(value)
def insert_requeue_raise(array):
listarray=[]
for index in range(len(array)):
value=array[index]
insert_value_raise(value,listarray)
array=listarray
print array
def insert_value_down(value,array):
for index in range(len(array)):
if value>array[index]:
array.insert(index,value)
return
array.append(value)
def insert_requene_down(array):
listarray=[]
for index in range(len(array)):
value=array[index]
insert_value_down(value,listarray)
array=listarray
print array
def main():
listarray=[100,55,12,89,0,7,6,8,88,55,4,1,5,10,4,3]
insert_requeue_raise(listarray)
insert_requene_down(listarray)
if __name__ == "__main__":
#coding=utf-8
#插入排序
def insert_value_raise(value,array):
for index in range(len(array)):
if value<array[index]:
array.insert(index,value)
return
array.append(value)
def insert_requeue_raise(array):
listarray=[]
for index in range(len(array)):
value=array[index]
insert_value_raise(value,listarray)
array=listarray
print array
def insert_value_down(value,array):
for index in range(len(array)):
if value>array[index]:
array.insert(index,value)
return
array.append(value)
def insert_requene_down(array):
listarray=[]
for index in range(len(array)):
value=array[index]
insert_value_down(value,listarray)
array=listarray
print array
def main():
listarray=[100,55,12,89,0,7,6,8,88,55,4,1,5,10,4,3]
insert_requeue_raise(listarray)
insert_requene_down(listarray)
if __name__ == "__main__":
main()
打印结果:
[0, 1, 3, 4, 4, 5, 6, 7, 8, 10, 12, 55, 55, 88, 89, 100]
[100, 89, 88, 55, 55, 12, 10, 8, 7, 6, 5, 4, 4, 3, 1, 0]
当然python list有自带的排序算法
listarray=[100,55,12,89,0,7,6,8,88,55,4,1,5,10,4,3]
listarray.sort()