Data-Structures-Algorithm-DSA-/sumOfArray.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
package main

import "fmt"

// Space Complexity: O(1)
func sumOfArray(arr []int) int {

	total := 0

	for i := 0; i < len(arr); i++ {

		total += arr[i]
	}

	return total
}

// Space Complexity: O(n)
func doubleArray(arr []int) []int {

	newArr := []int{}

	for i := 0; i < len(arr); i++ {

		newArr = append(newArr, arr[i]*2)
	}

	return newArr
}

func main() {

	fmt.Println(sumOfArray([]int{25, 25, 50}))

	fmt.Println(doubleArray([]int{25, 25, 50}))
}