Sorting algorithms/Insertion sort: Difference between revisions
→{{header|Phix}}
m (→{{header|Sidef}}: minor code simplifications) |
|||
Line 1,708:
<pre>input = 22 7 2 -5 8 4
output = -5 2 4 7 8 22
</pre>
=={{header|Phix}}==
Copy of [[Sorting_algorithms/Insertion_sort#Euphoria|Euphoria]]
<lang Phix>function insertion_sort(sequence s)
object temp
integer j
for i=2 to length(s) do
temp = s[i]
j = i-1
while j>=1 and s[j]>temp do
s[j+1] = s[j]
j -= 1
end while
s[j+1] = temp
end for
return s
end function
constant s = {4, 15, "delta", 2, -31, 0, "alpha", 19, "gamma", 2, 13, "beta", 782, 1}
puts(1,"Before: ") ?s
puts(1,"After: ") ?insertion_sort(s)</lang>
{{out}}
<pre>
Before: {4,15,"delta",2,-31,0,"alpha",19,"gamma",2,13,"beta",782,1}
After: {-31,0,1,2,2,4,13,15,19,782,"alpha","beta","delta","gamma"}
</pre>
| |||