blob: 00f0ecc641ae242ca3df8348a3bc4f8f989f661f (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
// Insertion sort
IS(ret) >< [] => ret~[];
IS(ret) >< x:xs => (*L)I(ret, x)~cnt, (*R)IS(cnt)~xs;
I(ret, int x) >< [] => ret~[x];
I(ret, int x) >< (int y):ys
| x<=y => ret~(*L)(x:(*R)(y:ys))
| _ => ret~(*L)(y:cnt), (*R)I(cnt, x)~ys;
const LIST_ELEM=40000;
MkRandList(ret) >< (int n)
| n>0 => ret~(rd:cnt), (*L)MkRandList(cnt)~(n-1)
where rd=rand(10000)
| _ => ret~[];
MkRandList(cnt)~(LIST_ELEM),
IS(ret)~cnt;
ret;
|
