Generate the prime numbers using bitArray(c#)

here's a method to generate prime numbers.
ok, let's go!!


namespace bitArray
{
class CArray
{
private int[] arr;
private int upper;
private int numElements;
public CArray(int size)
{
arr = new int[size];
upper = size - 1;
numElements = 0;
}
public void Insert(int item)
{
arr[numElements] = item;
numElements++;
}
public void DisplayElements()
{
for (int i = 0; i <= upper; i++)
{
Console.Write(arr[i]+" ");
}
}
public void Clear()
{
for (int i = 0; i <= upper; i++)
{
arr[i] = 0;
numElements = 0;
}
}
//generate the prime number
public void GenPrime()
{
int temp;
for (int i = 2; i <= arr.GetUpperBound(0); i++)
{
for (int j = i + 1; j <= arr.GetUpperBound(0); j++)
{
if (arr[j] == 1)
{
if ((j % i) == 0)
{
arr[j] = 0;
}
}
}
}
}
//dsiplay the prime number
public void ShowPrime()
{
for (int i = 2; i <= arr.GetUpperBound(0); i++)
{
if (arr[i] == 1)
{
Console.Write(i+" ");
}
}
}
}
class Program
{
static void Main(string[] args)
{
int size = 100;
CArray primes = new CArray(size);
for (int i = 0; i <= size - 1; i++)
{
primes.Insert(1);
}
primes.GenPrime();
primes.ShowPrime();
}
}
}