Loved the solutions: no intermediate vars, no unnecessary function declarations, using higher level operations and better knowledge of available features (execute, etc.), all the way up to the single line--but only because I'm a < 80 column coder when possible. 😉
It seems to me the main difference is in APL familiarity. If you look in the GNU APL info manual, there's a chapter on conditionals including how to write them in standard syntax, and why they're not doing the many : keyword Dyalog dialect (demonstrated here when they broke at 18:40). I'm not fluent in APL and my cursory documentation check didn't find an indication the ∇ for recursion was in GNU APL, though; that could be a big difference. In BQN we could use 𝕊, but •_while_ exists to guarantee the stack behaviour.
Too compressed for my taste - if you watch the full video then you can follow along. But where you given the function as it is in the end you would end up having to do this exercise in reverse
Beautiful. I liked the ("diamond") ⊣ trick! Actually I liked all improvements, as they were (quite) all semantic driven. Obviously the last one was pushy, not for a col-number reason but because in my opinion it mixed different aspects of the program. Thanks for this video. Really instructive.
Very clear and enjoyed the exploration of different programming styles.
Loved the solutions: no intermediate vars, no unnecessary function declarations, using higher level operations and better knowledge of available features (execute, etc.), all the way up to the single line--but only because I'm a < 80 column coder when possible. 😉
Epic. So much better than GNU APL.
It seems to me the main difference is in APL familiarity.
If you look in the GNU APL info manual, there's a chapter on conditionals including how to write them in standard syntax, and why they're not doing the many : keyword Dyalog dialect (demonstrated here when they broke at 18:40).
I'm not fluent in APL and my cursory documentation check didn't find an indication the ∇ for recursion was in GNU APL, though; that could be a big difference. In BQN we could use 𝕊, but •_while_ exists to guarantee the stack behaviour.
Too compressed for my taste - if you watch the full video then you can follow along. But where you given the function as it is in the end you would end up having to do this exercise in reverse
Yeah, the one-liner was just for fun. Don't do that in production.
@@abrudz got it 😉
Beautiful. I liked the ("diamond") ⊣ trick!
Actually I liked all improvements, as they were (quite) all semantic driven. Obviously the last one was pushy, not for a col-number reason but because in my opinion it mixed different aspects of the program.
Thanks for this video. Really instructive.
Yeah, the last one was just because I could, not because you should 🙂