Anonymous user
Sorting algorithms/Comb sort: Difference between revisions
solved for maxscript
(Add Nimrod) |
(solved for maxscript) |
||
Line 801:
1 2 3 4 5 6</lang>
=={{header|MAXScript}}==
<lang MAXScript>fn combSort arr =
(
local gap = arr.count
local swaps = 1
while not (gap == 1 and swaps == 0) do
(
gap = (gap / 1.25) as integer
if gap < 1 do
(
gap = 1
)
local i = 1
swaps = 0
while not (i + gap > arr.count) do
(
if arr[i] > arr[i+gap] do
(
swap arr[i] arr[i+gap]
swaps = 1
)
i += 1
)
)
return arr
)</lang>
Output:
<lang MAXScript>
a = for i in 1 to 10 collect random 1 10
#(2, 6, 5, 9, 10, 7, 2, 6, 1, 4)
combsort a
#(1, 2, 2, 4, 5, 6, 6, 7, 9, 10)
</lang>
=={{header|NetRexx}}==
| |||