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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
extern rand = () => i64;
extern malloc = (i64) => *void;
extern free = (*void) => void;
import "!stdlib.pry";
let init_array = (n: i64, arr: *i64) => void {
let i = 0;
while i < n {
(*(arr + cast(*i64, i))) = rand();
i = i + 1;
};
return;
};
let print_array = (n: i64, arr: *i64) => void {
let i = 0;
while i < n {
printf("%d\n", *(arr + cast(*i64, i)));
i = i + 1;
};
return;
};
let sort_array = (n: i64, arr: *i64) => void {
let i = 0;
let j = 0;
while i < n {
j = i + 1;
while j < n {
let x = *(arr + cast(*i64, i));
let y = *(arr + cast(*i64, j));
if x > y {
let tmp = *(arr + cast(*i64, i));
(*(arr + cast(*i64, i))) = *(arr + cast(*i64, j));
(*(arr + cast(*i64, j))) = tmp;
};
j = j + 1;
};
i = i + 1;
};
return;
};
let main = () => i64 {
let n = 10;
let arr = cast(*i64, malloc(n * 8));
init_array(n, arr);
printf("Pre-sorted:\n");
print_array(n, arr);
sort_array(n, arr);
printf("Sorted:\n");
print_array(n, arr);
free(cast(*void, arr));
return 0;
};
/*
Expected stdout:
Pre-sorted:
${UNSORTED_LIST}
Sorted:
${SORTED_LIST}
Expected return: 0
*/
|
