Yep, this thread has legs!
The FMP community is awesome.
–
If anyone wants to have some fun, now that FMP 18 has a “while” statement (“for statement” coming in FMP 101…LOL), implement the Sieve of Eratosthenes in FMP and see what kind of performance you get for getting the prime numbers from the first 100,000,000 (100M) integers.
This is super fun and simple-to-implement algorithm taught in intro programming classes (probably even in high schools these days…)
Sieve of Eratosthenes - Wikipedia
–
(for comparison, in Java it takes 1.9 seconds to get all primes from the first 100,000,000 integers.)