Pascal's triangle algorithm based on a recursive approach

ptrecursive.go

func pascalTriangleRecursive(cnt, row int, elements []int) []int {
	if cnt < row {
		temp := []int{1}
		for i, j := range elements[:len(elements)-1] {
			temp = append(temp, j+elements[i+1])
		}
		temp = append(temp, 1)
		return pascalTriangleRecursive(cnt+1, row, temp)
	}
	return elements
}