Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted
m (→‎{{header|Phix}}: added syntax colouring the hard way)
Line 760: Line 760:
arr: new items
arr: new items
loop 1..(size items)-1 'i [
loop 1..(size items)-1 'i [
value: arr \ i
value: arr\[i]
j: i - 1
j: i - 1


while [and? -> j >= 0
while [and? -> j >= 0
-> value < arr \ j]
-> value < arr\[j]]
[
[
set arr j+1 get arr j
arr\[j+1]: arr\[j]
j: j - 1
j: j - 1
]
]
set arr j + 1 value
arr\[j+1]: value
]
]
return arr
return arr