I have this algorithm:

```
function f(arr, i, n) {
if (i == n - 1) {
return arr[i];
}
if (i == 0) {
return (arr[i] + f(arr, i + 1, n)) / n;
} else {
return arr[i] + f(arr, i + 1, n);
}
}
```

It is a recursive algorithm, but it only calls once per lap.

I thought it could be an algorithm with an O (1 ^ n) notation, but if that’s the case,

```
(1 ^ 1) = 1 (1 ^ 2) = 1 (1 ^ 3) = 1
```

etc

So wouldn’t it be an O (1)? With a constant Big O notation?

http://kamagraday.com/ sildenafil

https://cialisbob.com/ how much does cialis cost at walmart

http://himscanada.com/ walmart tadalafil prices without insurance

https://prescriptionhim.com/ online viagra prescription

https://himshairloss.com/ alopecia support groups

http://withoutdrvisit.com buy line viagra

https://stromectolhumans.com/ stromectol an effective replacement for ivermectin

https://viagraxyu.com buy viagra tablets