f2c4dc81
 Salvador Abreu
added most of the...
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
|
# quicksort recursivo, com a instrução "break".
MAX: int = 100000;
array: [MAX] int;
qsort = map (l, r) -> () [
i := l;
j := r;
x := array[(l+r)/2];
* [ true -> * [ array[i] < x -> i := i+1; ];
* [ x < array[j] -> j := j-1; ];
? [ i <= j -> (array[i], array[j]) := (array[j], array[i]);
i := i+1;
j := j-1; ];
? [ i > j -> break; ] ];
? [ l<j -> @ (l, j) ];
? [ i<r -> @ (i, r) ];
];
initialize = map () -> () [
i := 0;
r := 333;
* [ i<MAX -> r := (1317 * r) % 214748;
array[i] := r;
i := i+1; ]
];
program = map () -> () [
initialize ();
qsort (0, MAX-1);
]
|