mirrors/eiffel-org
1
0
Fork 0
mirror of https://github.com/EiffelSoftware/eiffel-org.git synced 2025-12-07 15:22:31 +01:00
Code Issues Packages Projects Releases Wiki Activity

Clarified Source.

Browse Source 
Author:halw
Date:2010-04-03T21:49:19.000000Z


git-svn-id: https://svn.eiffel.com/eiffel-org/trunk@543 abb3cda0-5349-4a8f-a601-0c33ac3a8c38
This commit is contained in:
halw
2010-04-03 21:49:19 +00:00
parent 0c1e27b225
commit 25c0dd7454
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
documentation/current/examples/example-sieve-eratosthenes.wiki
View File

@@ -6,12 +6,13 @@
Deliver prime numbers up to a specified integer limit. Compute prime numbers using sieve of Eratosthenes.
This example uses the ''iteration'' (<code>across</code>) form of the Eiffel loop construct to traverse a list, an array, and an integer interval.
==Notes==
This example uses the ''iteration'' (<code>across</code>) form of the Eiffel loop construct to traverse a list, an array, and an integer interval.
==Source==
[http://rosettacode.org/wiki/Seive_of_Eratosthenes Rosetta Code]
Problem description from [http://rosettacode.org/wiki/Seive_of_Eratosthenes Rosetta Code]
==Solution==