编程用递归方法求组合函数Cmn

编程用递归方法求组合函数Cmn求解
2025-03-11 04:11:41
推荐回答(1个)
回答1:

递归形式不完整,应该是
C(m,0)=1
C(m.1)=m
C(m, n)=C(m, m-n)
C(m,n)=C(m-1, n)+C(m-1, n-1)
建立三个text1, text2, text3,代码如下:
Private Sub Form_Click()
n = Val(Text1)
m = Val(Text2)
Text3 = cmn(n, m)
End Sub
Private Function cmn(ByVal n As Long, ByVal m As Long) As Long
If n > m / 2 Then n = m - n
If n > 1 Then
cmn = cmn(n, m - 1) + cmn(n - 1, m - 1)
Else
If n = 0 Then cmn = 1
If n = 1 Then cmn = m
End If
End Function