test/syntax/algorithms.fln is the converter's fixture again
This commit is contained in:
parent
cecbec6c71
commit
1cfe97548a
@ -27,30 +27,19 @@ fn selection-sort(coll: [$t]) -> () where ordered?($t)
|
||||
fn insertion-sort(coll: [$t]) -> () where ordered?($t)
|
||||
let i = 1
|
||||
let length = length(coll)
|
||||
while i < length
|
||||
while and(i < length)
|
||||
let j = i
|
||||
while j > 0 and coll[j] < coll[dec(j)]
|
||||
let temp = coll[j]
|
||||
coll[j] = coll[dec(j)]
|
||||
coll[dec(j)] = temp
|
||||
--(j)
|
||||
++(i)
|
||||
|
||||
fn insertion-sort-dyn(coll)
|
||||
let i = 1
|
||||
let length = length(coll)
|
||||
while i < length
|
||||
let j = i
|
||||
while j > 0 and coll[j] < coll[dec(j)]
|
||||
let temp = coll[j]
|
||||
coll[j] = coll[dec(j)]
|
||||
coll[dec(j)] = temp
|
||||
--(j)
|
||||
while j > 0
|
||||
and coll[j] < coll[dec(j)]
|
||||
let temp = coll[j]
|
||||
coll[j] = coll[dec(j)]
|
||||
coll[dec(j)] = temp
|
||||
--(j)
|
||||
++(i)
|
||||
|
||||
fn main() -> i32 = 0
|
||||
|
||||
comment:
|
||||
comment():
|
||||
insertion-sort([\I \N \S \E \R \T \I \O \N \S \O \R \T])
|
||||
insertion-sort(slice([6 2 4 9 1 9 4 5], 0, 8))
|
||||
let str = bytes("INSERTIONSORT")
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user