Algorithme

Réponse acceptée !
Voila un algo recussif qui marche :

 Type Tinteger
 Tint() As Integer
 
End Type

Private Function enlever_Elt(E As Tinteger, ByVal rang As Integer) As Tinteger
Dim i As Integer
Dim res As Tinteger
ReDim Preserve res.Tint(0 To UBound(E.Tint)) As Integer

res = E
For i = rang + 1 To UBound(E.Tint)
     res.Tint(i - 1) = res.Tint(i)
Next i
ReDim Preserve res.Tint(0 To UBound(E.Tint) - 1) As Integer
enlever_Elt = res

End Function
Private Function egal(E1 As Tinteger, E2 As Tinteger) As Boolean

Dim i, j As Integer
egal = True
If UBound(E1.Tint) <> UBound(E2.Tint) Then
    egal = False
    Exit Function
End If
For i = 0 To UBound(E1.Tint)
     If E1.Tint(i) <> E2.Tint(i) Then egal = False

Next i

End Function
Private Function existeTab(T() As Tinteger) As Boolean

Dim i As Integer
On Error GoTo fin
i = UBound(T)
existeTab = True
Exit Function
fin:
existeTab = False

End Function
Private Sub algo(E As Tinteger, T() As Tinteger)
Dim i, j As Integer
Dim test As Boolean
test = False

If existeTab(T) = True Then
    For i = 0 To UBound(T)
        If egal(E, T(i)) Then test = True
    Next i
End If
'si E n'est pas dans T on le rajoute
If test = False Then
    If existeTab(T) = True Then
        ReDim Preserve T(0 To UBound(T) + 1) As Tinteger
    Else: ReDim T(0) As Tinteger
    End If
    T(UBound(T)) = E
End If
For i = 0 To UBound(E.Tint)
    If UBound(E.Tint) <> 0 Then
        Call algo(enlever_Elt(E, i), T)
    End If
Next i

End Sub