Sorry if this is a dumb question, but I found this expression from https://www.jsoftware.com/papers/50/50_36.htm which calculates the first ten Fibonacci numbers:
fib2←{⊃+\∘⌽⍣⍵⍳2}
fib2¨ ⍳10
0 1 1 2 3 5 8 13 21 34
Am I correct to assume that this is not very efficient, since the `+\∘⌽` operation is run `+/⍳10` or 45 times?