about summary refs log tree commit diff
path: root/examples/21.src
blob: 62f3ddab67e57fb19b78f33c9f91a4b630e6a7a1 (plain) (blame)
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
extern printf = (*i64, varargs) => void;
extern rand = () => i64;
extern malloc = (i64) => *i64;
extern free = (*i64) => void;

let init_array = (n: i64, arr: *i64) => i64 {
	let i = 0;
	while i < n {
		(*(arr + i)) = rand();
		i = i + 1;
	};
	return 0;
};

let print_array = (n: i64, arr: *i64) => i64 {
	let i = 0;
	while i < n {
		printf("%d\n", *(arr + i));
		i = i + 1;
	};
	return 0;
};

let sort_array = (n: i64, arr: *i64) => i64 {
	let i = 0;
	let j = 0;

	while i < n {
		j = i + 1;
		while j < n {
			let x = *((arr + i));
			let y = *((arr + j));

			if x > y {
				let tmp = (*(arr + i));
				(*(arr + i)) = (*(arr + j));
				(*(arr + j)) = tmp;
			};

			j = j + 1;	
		};
		i = i + 1;
	};

	return 0;
};

let main = () => i64 {
	let n = 10;
	let arr = 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(arr);

	return 0;
};

/*

Expected stdout:

Pre-sorted:
${UNSORTED_LIST}
Sorted:
${SORTED_LIST}

Expected return: 0

*/