For example:
ulong fibonacci(ulong n) { .... }
static x = fibonacci(50); // calculated at compile time! runtime
cost = 0 !!!
2) It has support for a BigInt structure in its standard library (which is really fast!)
For example:
ulong fibonacci(ulong n) { .... }
static x = fibonacci(50); // calculated at compile time! runtime
cost = 0 !!!
2) It has support for a BigInt structure in its standard library (which is really fast!)