Data-Structures-Algorithm-DSA-/recursion02.go at master · Anower77/Data-Structures-Algorithm-DSA- · GitHub

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
49
50
51
52
53
54
55
56
57
58
package main

import (
	"fmt"
	"time"
)

// Slow version
func sumOfArraySlow(arr []int) int {

	if len(arr) == 0 {
		return 0
	}

	rest := arr[1:]

	return arr[0] + sumOfArraySlow(rest)
}

// Fast version
func sumOfArrayFast(arr []int) int {

	return helperSum(arr, 0)
}

func helperSum(arr []int, index int) int {

	if len(arr) == index {
		return 0
	}

	return arr[index] + helperSum(arr, index+1)
}

func main() {

	input := make([]int, 9000)

	for i := range input {
		input[i] = 1
	}

	now := time.Now()

	fmt.Println(sumOfArraySlow(input))

	finish := time.Since(now)

	fmt.Println("time elapsed for slowFunction:", finish)

	start := time.Now()

	fmt.Println(sumOfArrayFast(input))

	end := time.Since(start)

	fmt.Println("time elapsed for fastFunction:", end)
}