A space to discuss and keep up software development and manage your software career
An inclusive community for gaming enthusiasts
News and discussion of science and technology such as AI, VR, cryptocurrency, quantum computing, and more.
From composing and gigging to gear, hot music takes, and everything in between.
Discussing AI software development, and showing off what we're building.
Movie and TV enthusiasm, criticism and everything in-between.
A general discussion space for the Forem community. If it doesn't have a home elsewhere, it belongs here
Memes and software development shitposting
Web design, graphic design and everything in-between
A community of golfers and golfing enthusiasts
A community for makers, hobbyists, and professionals to discuss Arduino, Raspberry Pi, 3D printing, and much more.
Your central hub for all things security. From ethical hacking and CTFs to GRC and career development, for beginners and pros alike
For engineers building software at scale. We discuss architecture, cloud-native, and SRE—the hard-won lessons you can't just Google
Discussing the core forem open source software project — features, bugs, performance, self-hosting.
A collaborative community for all things Crypto—from Bitcoin to protocol development and DeFi to NFTs and market analysis.
In Perl 6 you can do something like this:
my @fib = 0, 1, * + * ... *
This make uses of the ... sequence operator, which will produce (possibly lazy) generic sequences on demand.
Then you can get the first 10 Fibonacci numbers:
10
@fib[0..10]
More detailed explanation about this (not mine) could be found at: perl6.online/2018/12/15/playing-wi... and perl6advent.wordpress.com/2010/12/...
If you could get this to return a single number for value n, you'd be set up to get the bonus points for no loops or recursion! 🔂
n
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
In Perl 6 you can do something like this:
This make uses of the ... sequence operator, which will produce (possibly lazy) generic sequences on demand.
Then you can get the first
10
Fibonacci numbers:More detailed explanation about this (not mine) could be found at: perl6.online/2018/12/15/playing-wi... and perl6advent.wordpress.com/2010/12/...
If you could get this to return a single number for value
n
, you'd be set up to get the bonus points for no loops or recursion! 🔂