python之插入排序

print("insert algorithm ...")

def insert(lst):
    num = len(lst)
    for i in range(1, num, 1):
        t = lst[i]
        for j in range(i-1, -1, -1):
            if t < lst[j]:
                lst[j+1] = lst[j]
                lst[j] = t

list = [3, 4, 0, 1, 2]
insert(list)
print(list)

 

>>> ================================ RESTART ================================
>>>
insert algorithm ...
[0, 1, 2, 3, 4]
>>>

C++:

int a[] = {3,2,0,1,4};


for (int i = 1; i < sizeof(a)/sizeof(int); i++)
{
int t = a[i];
for (int j = 0; j < i-1; j++)
{
if (t < a[j])
{
int tmp = a[j];
a[j] = t;
t = tmp;
}
}
cout<<i<<endl;
}