Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
→{{header|Groovy}}: new solution
(Cleaned D code) |
(→{{header|Groovy}}: new solution) |
||
Line 564:
sorted! [23 26 31 41 53 58 59 84 93 97]
</pre>
=={{header|Groovy}}==
Solution:
<lang groovy>def insertionSort = { list ->
def size = list.size()
(1..<size).each { i ->
def value = list[i]
def j = i - 1
for (; j >= 0 && list[j] > value; j--) {
list[j+1] = list[j]
}
list[j+1] = value
}
list
}</lang>
Test:
<lang groovy>println (insertionSort([23,76,99,58,97,57,35,89,51,38,95,92,24,46,31,24,14,12,57,78,4]))
println (insertionSort([88,18,31,44,4,0,8,81,14,78,20,76,84,33,73,75,82,5,62,70,12,7,1]))</lang>
Output:
<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>
=={{header|Haskell}}==
| |||