Sum and product of an array: Difference between revisions
add bqn
(Emacs Lisp: Rework solution) |
(add bqn) |
||
Line 547:
>1- \ & + \v
^ <</lang>
=={{header|BQN}}==
Getting the sum and product as a two element array fits nicely within a tacit fork pattern.
* Sum <code>+´</code>
* Paired with <code>⋈</code>
* Product <code>×´</code>
<lang bqn> SumProd ← +´⋈×´
+´⋈×´
SumProd 1‿2‿3‿4‿5
⟨ 15 120 ⟩</lang>
=={{header|Bracmat}}==
| |||