Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 06:49, 13 November 2019
, 4 years agono edit summary
No edit summary |
|||
Line 2,151:
END IntSort;
END InsertSort.</lang>
=={{header|Nanoquery}}==
{{trans|Python}}
<lang Nanoquery>def insertion_sort(L)
for i in range(1, len(L) - 1)
j = i - 1
key = L[i]
while (L[j] > key) and (j >= 0)
L[j + 1] = L[j]
j -= 1
end
L[j+1] = key
end
return L
end</lang>
=={{header|N/t/roff}}==
| |||