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

Another update from ingydotnet^djgoku

Browse source
This commit is contained in:
Ingy döt Net 2015-11-18 06:14:39 +00:00
parent 91df62d461
commit 948b86eafa
7604 changed files with 108452 additions and 22726 deletions
Download patch file Download diff file Expand all files Collapse all files

72
Task/Sorting-algorithms-Comb-sort/Eiffel/sorting-algorithms-comb-sort-1.e
View file

@ -1,44 +1,70 @@
class
COMB_SORT[G -> COMPARABLE]
COMB_SORT [G -> COMPARABLE]
feature
combsort (ar: ARRAY[G]): ARRAY[G]
combsort (ar: ARRAY [G]): ARRAY [G]
-- Sorted array in ascending order.
require
array_not_empty: ar.count >0
array_not_void: ar /= Void
local
gap, i: INTEGER
swap: G
swapped: BOOLEAN
shrink: REAL_64
do
gap:= ar.count
create Result.make_empty
Result.deep_copy (ar)
gap := Result.count
from
until
gap= 1 and swapped = false
gap = 1 and swapped = False
loop
from
i:= 1
swapped:= false
i := Result.lower
swapped := False
until
i+gap > ar.count
i + gap > Result.count
loop
if ar[i]> ar[i+gap] then
swap:= ar[i]
ar[i]:= ar[i+gap]
ar[i+gap]:= swap
swapped:= TRUE
if Result [i] > Result [i + gap] then
swap := Result [i]
Result [i] := Result [i + gap]
Result [i + gap] := swap
swapped := True
end
i:= i+1
i := i + 1
end
shrink:= gap/1.3
gap:= shrink.floor
if gap <1 then
gap:= 1
shrink := gap / 1.3
gap := shrink.floor
if gap < 1 then
gap := 1
end
end
RESULT:= ar
ensure
RESULT_is_set: Result /= VOID
ensure
Result_is_set: Result /= Void
Result_is_sorted: is_sorted (Result)
end
feature {NONE}
is_sorted (ar: ARRAY [G]): BOOLEAN
--- Is 'ar' sorted in ascending order?
require
ar_not_empty: ar.is_empty = False
local
i: INTEGER
do
Result := True
from
i := ar.lower
until
i = ar.upper
loop
if ar [i] > ar [i + 1] then
Result := False
end
i := i + 1
end
end
end

40
Task/Sorting-algorithms-Comb-sort/Eiffel/sorting-algorithms-comb-sort-2.e
View file

@ -1,24 +1,32 @@
class
APPLICATION
inherit
ARGUMENTS
create
make
make
feature
make
do
test:= <<1,5,99,2,95, 7,-7>>
io.put_string ("unsorted"+"%N")
across test as ar loop io.put_string(ar.item.out + "%T") end
io.put_string ("%N"+"sorted:"+"%N")
create combsort
test:=combsort.combsort(test)
across test as ar loop io.put_string (ar.item.out + "%T") end
end
combsort: COMB_SORT[INTEGER]
test: ARRAY[INTEGER]
make
do
test := <<1, 5, 99, 2, 95, 7, -7>>
io.put_string ("unsorted" + "%N")
across
test as ar
loop
io.put_string (ar.item.out + "%T")
end
io.put_string ("%N" + "sorted:" + "%N")
create combsort
test := combsort.combsort (test)
across
test as ar
loop
io.put_string (ar.item.out + "%T")
end
end
combsort: COMB_SORT [INTEGER]
test: ARRAY [INTEGER]
end