用递归算法列出7个字母的组合与每个组合的全排列,不用递归能实现吗?

dhj_gz

用递归算法列出7个字母的组合与每个组合的全排列,不用递归能实现吗?
原代码如下:

Dim Zeile

Sub hh()

Dim ar(1 To 7) As String
Dim x As Integer
ar(1) = "a"
ar(2) = "b"
ar(3) = "c"
ar(4) = "d"
ar(5) = "e"
ar(6) = "f"
ar(7) = "g"
p = 1
Zeile = 1
Call ff("", p, ar())
End Sub
Sub ff(x As String, z, a() As String)
For i = z To UBound(a())
    If i > UBound(a()) Then
        Exit Sub
    Else
               'Debug.Print x & a(i)
               'Zeile = Me.Rows.Row
               Call Textdreher("", x & a(i))
    End If
Call ff(x & a(i), i + 1, a())
'Zeile = Zeile + 1
Next
End Sub
Sub Textdreher(x As String, y As String)
    Dim i As Integer, j As Integer
    j = Len(y)
    If j < 2 Then
        Cells(Zeile, 1) = x & y
        Zeile = Zeile + 1
        'Debug.Print x & y
    Else
        For i = 1 To j
            Call Textdreher(x + Mid(y, i, 1), Left(y, i - 1) + Right(y, j - i))
        Next
    End If
End Sub

彭希仁

Sub pengxi()
    aa = Timer
    Dim x%
    Dim i%
    Dim j%
    Dim jj As Long
    a = [A65536].End(xlUp).Row + 1
    arr = Range("A1:A" & a)
    z = Cells(1, 2)
    ReDim arr1(1 To z + 1) As Long   '存地址
    ReDim arr2(1 To z + 1)   '存组合
   
    Open "d:\peng.txt" For Output As #1
    For i = z To 1 Step -1    '初始化
        arr1(i) = i
        arr2(i) = arr2(i + 1) & " " & arr(i, 1)
    Next i
    arr1(z + 1) = 1000
    Do
        jj = jj + 1                   '输出结果
     Print #1, arr2(1)

        For i = 1 To z
            If arr1(i + 1) - arr1(i) > 1 Then Exit For
        Next i

        arr1(i) = arr1(i) + 1
        arr2(i) = arr2(i + 1) & " " & arr(arr1(i), 1)

        For j = i - 1 To 1 Step -1
            arr1(j) = j
            arr2(j) = arr2(j + 1) & " " & arr(j, 1)
        Next j
    Loop While arr1(z) < a
    Close #1
    MsgBox "找到 " & jj & " 个解! 花费" & Format(Timer - aa, "0.00" & "保存在D:\peng.txt") & "秒"
End Sub

dhj_gz

怎么提示运行时错误?