Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 13:25, 22 November 2014
, 9 years agosolved for maxscript
m (Added Sidef language.) |
(solved for maxscript) |
||
Line 1,230:
)
)$</lang>
=={{header|MAXScript}}==
<lang MAXScript>
fn inSort arr =
(
arr = deepcopy arr
for i = 1 to arr.count do
(
j = i
while j > 1 and arr[j-1] > arr[j] do
(
swap arr[j] arr[j-1]
j -= 1
)
)
return arr
)
</lang>
Output:
<lang MAXScript>
b = for i in 1 to 20 collect random 1 40
#(2, 28, 35, 31, 27, 24, 2, 22, 15, 34, 9, 10, 22, 40, 26, 5, 23, 6, 18, 33)
a = insort b
#(2, 2, 5, 6, 9, 10, 15, 18, 22, 22, 23, 24, 26, 27, 28, 31, 33, 34, 35, 40)
</lang>
=={{header|Modula-3}}==
| |||