From 25c0dd7454d3fe4a779e376aac1208c259f3a1b3 Mon Sep 17 00:00:00 2001 From: halw Date: Sat, 3 Apr 2010 21:49:19 +0000 Subject: [PATCH] Clarified 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 --- .../current/examples/example-sieve-eratosthenes.wiki | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/documentation/current/examples/example-sieve-eratosthenes.wiki b/documentation/current/examples/example-sieve-eratosthenes.wiki index 4d79a221..4aed16d0 100644 --- a/documentation/current/examples/example-sieve-eratosthenes.wiki +++ b/documentation/current/examples/example-sieve-eratosthenes.wiki @@ -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'' (across) form of the Eiffel loop construct to traverse a list, an array, and an integer interval. +==Notes== +This example uses the ''iteration'' (across) 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==