On Thursday, 2 August 2018 at 14:37:56 UTC, Greatsam4sure wrote:
On Thursday, 2 August 2018 at 09:35:20 UTC, Cym13 wrote:
On Thursday, 2 August 2018 at 08:30:05 UTC, Greatsam4sure
wrote:
I know D is very powerful from my little experience. What is
the idiomatic way to get prime numbers say from
On Thursday, 2 August 2018 at 08:30:05 UTC, Greatsam4sure wrote:
I know D is very powerful from my little experience. What is
the idiomatic way to get prime numbers say from 1-30 without
using loops(outer and inner loop). Can map, filter, fold etc in
algorithm be use. Pls show some code with c
On Thursday, 2 August 2018 at 09:35:20 UTC, Cym13 wrote:
On Thursday, 2 August 2018 at 08:30:05 UTC, Greatsam4sure wrote:
I know D is very powerful from my little experience. What is
the idiomatic way to get prime numbers say from 1-30 without
using loops(outer and inner loop). Can map, filter,
On Thursday, 2 August 2018 at 08:30:05 UTC, Greatsam4sure wrote:
I know D is very powerful from my little experience. What is
the idiomatic way to get prime numbers say from 1-30 without
using loops(outer and inner loop). Can map, filter, fold etc in
algorithm be use. Pls show some code with c
On Thursday, 2 August 2018 at 08:30:05 UTC, Greatsam4sure wrote:
I know D is very powerful from my little experience. What is
the idiomatic way to get prime numbers say from 1-30 without
using loops(outer and inner loop). Can map, filter, fold etc in
algorithm be use. Pls show some code with c
I know D is very powerful from my little experience. What is the
idiomatic way to get prime numbers say from 1-30 without using
loops(outer and inner loop). Can map, filter, fold etc in
algorithm be use. Pls show some code with chain call.
I can easily achieve even numberd and odd numbers usi
