Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
| Line 1,680: | Line 1,680: | ||
end |
end |
||
ary = [7,6,5,9,8,4,3,1,2,0] |
ary = [7,6,5,9,8,4,3,1,2,0] |
||
ary.insertionsort! |
p ary.insertionsort! |
||
# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]</lang> |
# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]</lang> |
||
| Line 1,686: | Line 1,686: | ||
<lang ruby>class Array |
<lang ruby>class Array |
||
def insertionsort! |
def insertionsort! |
||
return if length < 2 |
|||
1.upto(length - 1) do |i| |
1.upto(length - 1) do |i| |
||
value = delete_at i |
value = delete_at i |
||
| Line 1,699: | Line 1,697: | ||
ary = [7,6,5,9,8,4,3,1,2,0] |
ary = [7,6,5,9,8,4,3,1,2,0] |
||
ary.insertionsort! |
p ary.insertionsort! |
||
# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]</lang> |
# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]</lang> |
||
=={{header|Run BASIC}}== |
=={{header|Run BASIC}}== |
||