def
insert_sort(lists) :
for i in range(len(lists)) :
if i == 0 : continue ;
j = i - 1 ;
if lists[j] >= lists[i] :
tmp = lists[i];
while j >= 0 and tmp < lists[j] :
lists[j + 1 ] = lists[j];
j -= 1 ;
lists[j + 1 ] = tmp;
return lists;
for i in range(len(lists)) :
if i == 0 : continue ;
j = i - 1 ;
if lists[j] >= lists[i] :
tmp = lists[i];
while j >= 0 and tmp < lists[j] :
lists[j + 1 ] = lists[j];
j -= 1 ;
lists[j + 1 ] = tmp;
return lists;