/
quicksort2.cmm
56 lines (52 loc) · 2.23 KB
/
quicksort2.cmm
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
(* TEST
readonly_files = "main.c";
arguments = "-DSORT -DFUN=quicksort main.c";
asmgen;
*)
(**************************************************************************)
(* *)
(* OCaml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 1996 Institut National de Recherche en Informatique et *)
(* en Automatique. *)
(* *)
(* All rights reserved. This file is distributed under the terms of *)
(* the GNU Lesser General Public License version 2.1, with the *)
(* special exception on linking described in the file LICENSE. *)
(* *)
(**************************************************************************)
(function "cmp" (i: int j: int)
(- i j))
(function "quick" (lo: int hi: int a: val cmp: val)
(if (< lo hi)
(letmut (i int lo
j int hi
pivot int (intaref a hi))
(while (< i j)
(catch
(while 1
(if (>= i hi) (exit n25) [])
(if (> (app cmp (intaref a i) pivot int) 0) (exit n25) [])
(assign i (+ i 1)))
with (n25) [])
(catch
(while 1
(if (<= j lo) (exit n35) [])
(if (< (app cmp (intaref a j) pivot int) 0) (exit n35) [])
(assign j (- j 1)))
with (n35) [])
(if (< i j)
(let temp (intaref a i)
(intaset a i (intaref a j))
(intaset a j temp))
[]))
(let temp (intaref a i)
(intaset a i (intaref a hi))
(intaset a hi temp))
(app "quick" lo (- i 1) a cmp unit)
(app "quick" (+ i 1) hi a cmp unit))
[]))
(function "quicksort" (lo: int hi: int a: val)
(app "quick" lo hi a "cmp" unit))