From 2be324f75e3ba04944e8bd748d67529ef0e4ee4e Mon Sep 17 00:00:00 2001
From: Gregory Gauthier <gregory.gauthier@perspectum.com>
Date: Fri, 6 Feb 2026 16:02:44 +0000
Subject: [PATCH] test member deletion logic

---
 jcl/SIEVE11.jcl |  6 ------
 src/SIEVE11.c   | 47 -----------------------------------------------
 2 files changed, 53 deletions(-)
 delete mode 100644 jcl/SIEVE11.jcl
 delete mode 100644 src/SIEVE11.c

diff --git a/jcl/SIEVE11.jcl b/jcl/SIEVE11.jcl
deleted file mode 100644
index 7658a75..0000000
--- a/jcl/SIEVE11.jcl
+++ /dev/null
@@ -1,6 +0,0 @@
-//SIEVE11  JOB (GCC),'Sieve 11 Example',
-//             NOTIFY=@05054,CLASS=A,MSGCLASS=H,
-//             MSGLEVEL=(1,1),REGION=4M,TIME=1440
-//* Compile Step
-//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIEVE11)'
-//
\ No newline at end of file
diff --git a/src/SIEVE11.c b/src/SIEVE11.c
deleted file mode 100644
index fededb7..0000000
--- a/src/SIEVE11.c
+++ /dev/null
@@ -1,47 +0,0 @@
-#include<stdio.h>
-
-#define LIMIT 10000
-#define PRIMES 1000
-
-
-int main()
-{
-   int i,j,numbers[LIMIT];
-   int primes[PRIMES];
-
-   for (i=0;i<LIMIT;i++)
-   {
-      numbers[i]=i+2;
-   }
-
-   for (i=0;i<LIMIT;i++)
-   {
-      if (numbers[i]!=-1)
-      {
-         for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
-            numbers[j]=-1;
-      }
-   }
-
-   j = 0;
-   for (i=0;i<LIMIT&&j<PRIMES;i++)
-     if (numbers[i]!=-1)
-        primes[j++] = numbers[i];
-
-   printf("\n");
-   printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
-   printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
-   printf("LIST OF PRIMES:\n\n");
-
-   for (i=0;i<PRIMES;i++)
-      if (i % 20 == 0)
-      {
-         printf("\n %4d ",primes[i]);
-      }
-      else
-      {
-         printf("%4d  ",primes[i]);
-      }
-
-   return 0;
-}