benchmarking

Node.js

  1. const Benchmark = require('benchmark')
  3. const suite = new Benchmark.Suite
  4. suite.add('fib#recursion', () => {
  5.   fibRec(10)
  6. })
  7. .add('fib#loop', () => {
  8.   fibLoop(10)
  9. })
  10. .on('complete', () => {
  11.   console.log(suite[0].toString())
  12.   console.log(suite[1].toString())
  13. })
  14. .run({
  15.   async: true
  16. })
  18. function fibRec(n) {
  19.   if (n <= 1) {
  20.     return n
  21.   }
  23.   return fibRec(n-1) + fibRec(n-2)
  24. }
  26. function fibLoop(n) {
  27.   let f = [0, 1]
  28.   for (let i = 2; i <= n; i++) {
  29.     f[i] = f[i-1] + f[i-2]
  30.   }
  31.   return f[n]
  32. }

Output

  1. $ node examples/benchmark_test.js
  2. fib#recursion x 1,343,074 ops/sec ±1.26% (84 runs sampled)
  3. fib#loop x 20,104,517 ops/sec ±3.78% (78 runs sampled)

Go

  1. package example
  3. import (
  4.     "testing"
  5. )
  7. func BenchmarkFibRec(b *testing.B) {
  8.     for n := 0; n < b.N; n++ {
  9.         fibRec(10)
  10.     }
  11. }
  13. func BenchmarkFibLoop(b *testing.B) {
  14.     for n := 0; n < b.N; n++ {
  15.         fibLoop(10)
  16.     }
  17. }
  19. func fibRec(n int) int {
  20.     if n <= 1 {
  21.         return n
  22.     }
  24.     return fibRec(n-1) + fibRec(n-2)
  25. }
  27. func fibLoop(n int) int {
  28.     f := make([]int, n+1, n+2)
  29.     if n < 2 {
  30.         f = f[0:2]
  31.     }
  32.     f[0] = 0
  33.     f[1] = 1
  34.     for i := 2; i <= n; i++ {
  35.         f[i] = f[i-1] + f[i-2]
  36.     }
  37.     return f[n]
  38. }

Output

  1. $ go test -v -bench=. -benchmem examples/benchmark_test.go
  2. goos: darwin
  3. goarch: amd64
  4. BenchmarkFibRec-8        5000000               340 ns/op               0 B/op          0 allocs/op
  5. BenchmarkFibLoop-8      30000000                46.5 ns/op            96 B/op          1 allocs/op
  6. PASS
  7. ok      command-line-arguments  3.502s