A video comparing the BQN and Uiua programming languages. We revisit the CheckMatrix problem previously solved and compare the tacit solutions in both languages.
Uiua:
UiuaPad Code: ← ≅↧1∶↥⇌.⊞=.⇡⧻.
CheckMatrix ↯[4 4][2 0 0 1 0 3 1 0 0 5 2 0 4 0 0 2]
CheckMatrix ↯[3 3][5 7 0 0 3 1 0 5 0]BQNPAD:
BQN:
BQN Code: #code=Q2hlY2tNYXRyaXgg4oaQIDHiirjijIriiaEo4oy94oq44oyIwrc94oycy5zCt KGleKJoCkKCuKAolNob3cgQ2hlY2tNYXRyaXggNOKAvzTipYrin6gyLDAsMCwxLDAsMywxLDAsMCw1LDIsMCw0LDAsMCwy4p pCiAgICAgIENoZWNrTWF0cml4IDPigL8z4qWK4p oNSw3LDAsMCwzLDEsMCw1LDDin6k=
APL vs BQN vs J vs Q vs NumPy vs Julia vs R Talk:
ArrayCast Uiua Episode:
Chapters:
0:00 Intro
0:38 Problem Description
1:20 Recap of Previous APL/J/BQN Solutions
2:22 Explicit BQN Solution
3:48 Tacit BQN Solution
6:10 Uiua Solution
8:16 The Beauty of Uiua
9:00 Outro
Follow me on Github:
Follow me on Twitter:
Follow me on LinkedIn: