Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
(→{{header|Groovy}}: new solution) |
(→{{header|Groovy}}: swap dots added) |
||
| Line 574: | Line 574: | ||
def j = i - 1 |
def j = i - 1 |
||
for (; j >= 0 && list[j] > value; j--) { |
for (; j >= 0 && list[j] > value; j--) { |
||
list[j+1] = list[j] |
print "."; list[j+1] = list[j] |
||
} |
} |
||
list[j+1] = value |
print "."; list[j+1] = value |
||
} |
} |
||
list |
list |
||
| Line 586: | Line 586: | ||
Output: |
Output: |
||
<pre>[4, 12, 14, 23, 24, 24, 31, 35, 38, 46, 51, 57, 57, 58, 76, 78, 89, 92, 95, 97, 99] |
<pre>..................................................................................................................................................................[4, 12, 14, 23, 24, 24, 31, 35, 38, 46, 51, 57, 57, 58, 76, 78, 89, 92, 95, 97, 99] |
||
[0, 1, 4, 5, 7, 8, 12, 14, 18, 20, 31, 33, 44, 62, 70, 73, 75, 76, 78, 81, 82, 84, 88]</pre> |
...............................................................................................................................................................[0, 1, 4, 5, 7, 8, 12, 14, 18, 20, 31, 33, 44, 62, 70, 73, 75, 76, 78, 81, 82, 84, 88]</pre> |
||
=={{header|Haskell}}== |
=={{header|Haskell}}== |
||