System.Windows.Forms.LinkLabelLinkClickedEventArgs) _
Handles llStart.LinkClicked
If IsNumeric(Me.txtMaxNbr.Text) = False Then
MsgBox("Max Nbr must be numeric!", _
MsgBoxStyle.Exclamation, _
"Max Nbr Not Numeric")
Return
End If
Dim N, i, j
N = CInt(Me.txtMaxNbr.Text)
Dim z(N)
Dim startTime As DateTime = Now
'initialize array
For i = 0 To N
z(i) = 0
Next
'mark multiples of i
For i = 2 To N / 2
For j = 2 * i To N Step i
z(j) = 1
Next
Next
'count unmarked numbers, which are primes
Dim nbr = 0
For i = 2 To N
If z(i) = 0 Then
nbr += 1
End If
Next
Dim ts As New TimeSpan(Now.Ticks - startTime.Ticks)
Me.lblNbrPrimes.Text = nbr
Me.lblTime.Text = ts.ToString
End Sub
回复:这段可笑的代码更坚定了我在VB.NET上的信心了
For j = 2 * i To N Step i
z(j) = 1
Next
Next
这个算法的意思是:遍历2到n/2的数i,对于每个i,在数组z中设置其所有的倍数为1。这个z其实可以用bool型表示,1为合数,0为质数。
For i = 2 To N
If z(i) = 0 Then
nbr += 1
End If
Next
遍历z,nbr记下一共有多少个质数。
原版算法请看:http://www.math.utah.edu/classes/216/assignment-07.html
这个算法确实很优,它的算法z(j)=1执行步数为x,x是小于N的所有合数的数目,很明显x<=N。