aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

June 2018 Update

Browse source
This commit is contained in:
Ingy döt Net 2018-06-22 20:57:24 +00:00
parent ba8067c3b7
commit 22f33d4004
5278 changed files with 84726 additions and 14379 deletions
Download patch file Download diff file Expand all files Collapse all files

25
Task/Sorting-algorithms-Cocktail-sort/Julia/sorting-algorithms-cocktail-sort.julia
View file

@ -1,27 +1,20 @@
function coctailsort{T<:Real}(a::Array{T,1})
function coctailsort(a::Vector)
b = copy(a)
isordered = false
lo = one(Int)
hi = length(b)
lo, hi = 1, length(b)
while !isordered && hi > lo
isordered = true
for i in lo+1:hi
if b[i] < b[i-1]
t = b[i]
b[i] = b[i-1]
b[i-1] = t
b[i-1], b[i] = b[i], b[i-1]
isordered = false
end
end
hi -= 1
if isordered || hi <= lo
break
end
if isordered || hi ≤ lo break end
for i in hi:-1:lo+1
if b[i-1] > b[i]
t = b[i]
b[i] = b[i-1]
b[i-1] = t
b[i-1], b[i] = b[i], b[i-1]
isordered = false
end
end
@ -30,9 +23,5 @@ function coctailsort{T<:Real}(a::Array{T,1})
return b
end
a = [rand(-2^10:2^10) for i in 1:20]
println("Before Sort:")
println(a)
a = coctailsort(a)
println("\nAfter Sort:")
println(a)
v = rand(-10:10, 10)
println("# unordered: $v\n -> ordered: ", cocktailsort(v))