From 964032ae28de8b80152dbbc0d346300766b3e760 Mon Sep 17 00:00:00 2001
From: Bobbi Webber-Manners <bobbi.manners@gmail.com>
Date: Fri, 11 May 2018 21:03:58 -0400
Subject: [PATCH] Updated sieve example to use const

---
 README.md | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 4c0e483..43230d5 100644
--- a/README.md
+++ b/README.md
@@ -1150,8 +1150,9 @@ Here is the well-known Sieve of Eratosthenes algorithm for finding prime numbers
 ```
  ' Sieve of Eratosthenes
 
-byte A[20*20] = 1
-call doall(20, A)
+const sz=20
+byte A[sz*sz] = 1
+call doall(sz, A)
 end
 
 sub doall(word nr, byte array[])