Is there a faster way to find prime numbers.

private static void Main(string[] args)
{
    var sw = Stopwatch.StartNew();
    var collection = new List<int>();

    //assume "2" as known, so let's start from 3
    for (int i = 3; i < 100000; i += 2)
    {
        //no reason to scan over the square-root of the integer under test
        double root = Math.Sqrt(i);

        bool found = false;
        for (int k = 0, count = collection.Count; k < count; k++)
        {
            int divisor;
            if ((divisor = collection[k]) > root)
            {
                //no futher reason to scan
                break;
            }
            else if ((i % divisor) == 0)
            {
                //found a divisor
                found = true;
                break;
            }
        }

        if (found == false)
        {
            //no divisor found, so add yet another prime number!
            collection.Add(i);
        }
    }

    //insert the known "2" as the very first
    collection.Insert(0, 2);

    Console.WriteLine("time=" + sw.ElapsedMilliseconds);
    Console.WriteLine("count=" + collection.Count);

    //display the entire collection (a text file on disk would be better, though)
    //foreach (int num in collection)
    //{
    //    Console.Write("{0}; ",num);
    //}

    //wait for a user keypress
    Console.ReadKey();
}

Dim p, n, i As Integer
p = 1
Print "Prime Numbers are : "
For n = 1 To 100
For i = 2 To n – 1
If n Mod i = 0 Then
p = 0
Exit For
Else
p = 1
End If

Next
If p = 1 Then
Print n
End If

Next