the-evolution-of-a-go-programmer

the-evolution-of-a-go-programmer copied to clipboard

Makes Rob Pike's code more readable :)

mohammed-maher

Not checking for integer overflow

1

You should be doing that, at least as a señor

YuriyNasretdinov

O(n) -> O(n-1)

4

soitsmutiny

https://www.reddit.com/r/golang/comments/f1hy9a/the_evolution_of_a_go_programmer/fh79dut/

chuhlomin

They will use matrix multiplication to solve it in O(log(N)) https://math.stackexchange.com/questions/784710/how-to-prove-fibonacci-sequence-with-matrices

giongto35

https://golang.org/pkg/math/big/#Int.Mul

iamtakingiteasy

```go for i := 2; i

iamtakingiteasy

```go // Factorial returns !n. func Factorial(n int) (res int) { res = 1 ... } ```

iamtakingiteasy

We need a `LICENSE.md` file.

SuperPaintman

We know more steps of the Gopher evolution. So go ahead and feel free to add them!

SuperPaintman