aboutsummaryrefslogtreecommitdiff
path: root/implementation
diff options
context:
space:
mode:
authorSteveU <steveulin@gmail.com>2022-08-14 16:43:31 -0700
committerGitHub <noreply@github.com>2022-08-14 16:43:31 -0700
commit921b7f91c1726b1e64a9477797b2464f73b07be0 (patch)
tree1f97839912f4c4442990a75a4d851cbcdd0b9a06 /implementation
parent8afd6d6d22e3b123423a95eae1389c3fa942a066 (diff)
[fifty.bqn] Update to fifty.bqn to use scans
Update #9 and #10 to use scans rather than nested arrays. Scans are faster, and I feel like provide a better working example for new BQN programmers. However, this does change the math a bit as scans in BQN are left to right whereas APL's are right to left.
Diffstat (limited to 'implementation')
0 files changed, 0 insertions, 0 deletions