Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
→{{header|jq}}
Walterpachl (talk | contribs) m (→{{header|ooRexx}}: fix trans tag) |
|||
Line 1,328:
{{Out}}
[null,-1.1,1,1,1.1,2,[null],{"null":null}]
=={{header|Kotlin}==
<lang kotlin>fun insertionSort(array: IntArray) {
for (index in 1 until array.size) {
val value = array[index]
var subIndex = index - 1
while (subIndex >= 0 && array[subIndex] > value) {
array[subIndex + 1] = array[subIndex]
subIndex--
}
array[subIndex + 1] = value
}
}
fun main(args: Array<String>) {
val numbers = intArrayOf(5, 2, 3, 17, 12, 1, 8, 3, 4, 9, 7)
fun printArray(message: String, array: IntArray) = with(array) {
print("$message [")
forEachIndexed { index, number ->
print(if (index == lastIndex) number else "$number, ")
}
println("]")
}
printArray("Unsorted:", numbers)
insertionSort(numbers)
printArray("Sorted:", numbers)
}</lang>
{{out}}
<pre>Unsorted: [5, 2, 3, 17, 12, 1, 8, 3, 4, 9, 7]
Sorted: [1, 2, 3, 3, 4, 5, 7, 8, 9, 12, 17]</pre>
=={{header|Liberty BASIC}}==
| |||