Lazy Prime Number Sieve in C#

2 Kicks

submitted by jemts(591) 4 years, 2 months ago

Creating a infite list of prime numbers using lazy infinite lists. Shows how two pretty lines of Haskell can be ported to C#.

add a comment |category: C# |Views: 25
Tweet

Please login or signup.

Add a live kick counter to your blog >> liveImage

You can even customize the image by choosing your own colors, and then clicking the button below to update the preview and the html code:

Simply copy and paste this HTML into your blog post.

Users who kicked this story:

Comments:

No comments so far

What's this?