1 |
1 |
2 def zero(x) = 0; |
2 def zero(x) = 0; |
3 |
3 |
4 def suc(x) = x + 1; |
4 def suc(x) = x + 1; |
5 |
5 |
6 def pred(x) = if x == 0 then x else x - 1; |
6 def pred(x) = |
|
7 if x == 0 then x else x - 1; |
7 |
8 |
8 def add(x, y) = if x == 0 then y else suc(add(x - 1, y)); |
9 def add(x, y) = |
|
10 if x == 0 then y else suc(add(x - 1, y)); |
9 |
11 |
10 def mult(x, y) = if x == 0 then 0 else add(y, mult(x - 1, y)); |
12 def mult(x, y) = |
|
13 if x == 0 then 0 else add(y, mult(x - 1, y)); |
11 |
14 |
12 def pow(x, y) = if y == 0 then 1 else mult(x, pow(x, y - 1)); |
15 def pow(x, y) = |
|
16 if y == 0 then 1 else mult(x, pow(x, y - 1)); |
13 |
17 |
14 def fib(n) = if n == 0 then 0 |
18 def fib(n) = if n == 0 then 0 |
15 else if n == 1 then 1 |
19 else if n == 1 then 1 |
16 else fib(n - 1) + fib(n - 2); |
20 else fib(n - 1) + fib(n - 2); |
17 |
21 |
18 def fact(n) = if n == 0 then 1 else n * fact(n - 1); |
22 def fact(n) = |
|
23 if n == 0 then 1 else n * fact(n - 1); |
19 |
24 |
20 def ack(m, n) = if m == 0 then n + 1 |
25 def ack(m, n) = if m == 0 then n + 1 |
21 else if n == 0 then ack(m - 1, 1) |
26 else if n == 0 then ack(m - 1, 1) |
22 else ack(m - 1, ack(m, n - 1)); |
27 else ack(m - 1, ack(m, n - 1)); |
23 |
28 |
25 |
30 |
26 def div(x, y) = x / y; //integer division |
31 def div(x, y) = x / y; //integer division |
27 |
32 |
28 def rem(x, y) = x % y; //remainder |
33 def rem(x, y) = x % y; //remainder |
29 |
34 |
30 def gcd(a, b) = if b == 0 then a else gcd(b, a % b); |
35 def gcd(a, b) = |
|
36 if b == 0 then a else gcd(b, a % b); |
31 |
37 |
32 def is_prime_aux(n, i) = |
38 def is_prime_aux(n, i) = |
33 if n % i == 0 then 0 |
39 if n % i == 0 then 0 |
34 else if (i * i) <= n then is_prime_aux(n, i + 1) |
40 else if (i * i) <= n then is_prime_aux(n, i + 1) |
35 else 1; |
41 else 1; |
51 else if is_collatz(i) == 1 then (write i; collatz_aux(n, i + 1)) |
57 else if is_collatz(i) == 1 then (write i; collatz_aux(n, i + 1)) |
52 else collatz_aux(n, i + 1); |
58 else collatz_aux(n, i + 1); |
53 |
59 |
54 def collatz(n) = collatz_aux(n, 1); |
60 def collatz(n) = collatz_aux(n, 1); |
55 |
61 |
56 def facT(n, acc) = if n == 0 then acc else facT(n - 1, n * acc); |
62 def facT(n, acc) = |
|
63 if n == 0 then acc else facT(n - 1, n * acc); |
57 |
64 |
58 |
65 |
59 //zero(3) |
66 //zero(3) |
60 //suc(8) |
67 //suc(8) |
61 //pred(7) |
68 //pred(7) |
62 //add(3, 4) |
69 //write(add(3, 4)) |
63 //mult(4,5) |
70 //mult(4,5) |
64 //pow(2, 3) |
71 //pow(2, 3) |
65 //fib(20) |
72 //fib(20) |
66 //(write(fact(5)) ; fact(6)) |
73 //(write(fact(5)) ; fact(6)) |
67 //(write(1) ; 2) |
74 //(write(1) ; 2) |
68 ack(3, 12) // for tail-rec test |
75 //write(ack(3, 12)) // for tail-rec test |
69 //stack_test(0) |
76 //stack_test(0) |
70 //(write (div(11, 3)); rem(11, 3)) |
77 //(write (div(11, 3)); rem(11, 3)) |
71 //gcd(54, 24) |
78 //gcd(54, 24) |
72 //is_prime(2) |
79 //is_prime(2) |
73 //primes(1000000) |
80 primes(1000000) |
74 //collatz(5000) |
81 //collatz(5000) |
75 //facT(6, 1) |
82 //facT(6, 1) |
76 |
83 |