blob: 55d87753d272ff39c6eae53656fb578645bf6fbe (
plain)
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
|
const int test 0x123;
type BloodType enum {
A,
B = 3,
AB,
ZERO = 0
}
type Person struct {
string firstName
string lastName
unsigned int age
BloodType bloodType
}
// Function to compute fibonacci numbers recursively
f<int> fib(int n) {
if n <= 2 {
return 1;
}
return fib(n - 1) + fib(n - 2);
}
// Function to compute factorial numbers recursively
inline f<int> fac(int input) {
if input < 2 {
return 1;
}
result = input * fac(input - 1);
}
/**
* Entry point of the program
*/
f<int> main() {
short number = 0d10s;
printf("Fibonacci of %d: %d\n", number, fib((int) number));
long base = (long) number;
base += 1;
base <<= 1;
base >>= 3 - 1;
base -= 1;
printf("Faculty of %d: %d\n", base + 7, fac((int) base + 7));
// Sizeof usage
int size = sizeof('T');
printf("Size of char is %d, %d\n", size, true);
}
|
