Sorting algorithms/Insertion sort: Difference between revisions
m
→{{header|Python}}
Drkameleon (talk | contribs) (Added Arturo implementation) |
Alextretyak (talk | contribs) |
||
Line 3,194:
j = i-1
key = L[i]
while
L[j+1] = L[j]
j -= 1
|