Anonymous user
Sort an integer array: Difference between revisions
m
reduce whitespace
m (reduce whitespace) |
|||
Line 441:
var numbers = [20, 7, 65, 10, 3, 0, 8, -60];
numbers.sort(numberSort);
document.write(numbers);</lang>
=={{header|K}}==
<lang k> num: -10?10 / Integers from 0 to 9 in random order▼
▲ num: -10?10 / Integers from 0 to 9 in random order
5 9 4 2 0 3 6 1 8 7
srt: {x@<x} / Generalized sort ascending
srt num
0 1 2 3 4 5 6 7 8 9</lang>
=={{header|Liberty BASIC}}==
LB has an array-sort command. Parameters are arrayname, start term, finish term.
<lang lb>N =20
dim IntArray( N)
Line 472 ⟶ 468:
for i =1 to N
print IntArray( i)
next i</lang>
=={{header|Lua}}==
Line 492 ⟶ 487:
=={{header|Mercury}}==
<lang>:- module sort_int_list.▼
▲:- module sort_int_list.
:- interface.
:- import_module io.
Line 506 ⟶ 500:
list.sort(Nums, Sorted),
io.write(Sorted, !IO),
io.nl(!IO).</lang>
Line 560 ⟶ 553:
say sorted.strip('t')
return</lang>
'''Output'''
Line 642 ⟶ 634:
say
return</lang>
'''Output'''
Line 748 ⟶ 738:
end
return</lang>
'''Output'''
Line 764 ⟶ 753:
'''Library'''
<lang Niue>2 6 1 0 3 8 sort .s
0 1 2 3 6 8</lang>
=={{header|Objective-C}}==
Line 1,084 ⟶ 1,072:
Because it so much more efficient to sort an array, an array is
built from the list, sorted, than the list is re-constituted.
<lang rexx>/*REXX program to sort an interesting integer list.*/
bell='1 1 2 5 15 52 203 877 4140 21147 115975' /*some Bell numbers.*/
Line 1,119 ⟶ 1,107:
end
end
return</lang>
Output:
<pre style="overflow:scroll">
Line 1,175 ⟶ 1,163:
> val it = () : unit
- Array.foldr op:: [] nums;
> val it = [1, 2, 2, 3, 4] : int list</lang>
===List===
| |||