二维数组使用桶排序

山菊花

我也觉得附件中的例子用桶排序不是最好的选择。

songdg

山菊花 发表于 2017-3-20 21:41
我也觉得附件中的例子用桶排序不是最好的选择。

感谢山总的大驾光临，非常感激您的无私的帮助。现在运行只花了11秒，也许不是最好的但是最快的。

songdg

想通过增加一个参数r控制升排或降排，还有什么改法更简洁的？
Function BucketSort2(aData, r)
    Dim i&, j&, aBucket(), nMinNum, nMaxNum, n&, aData2(), aBucket2
    nMinNum = aData(1, 1): nMaxNum = nMinNum
    For i = 1 To UBound(aData, 2)
        If aData(1, i) < nMinNum Then nMinNum = aData(1, i)
        If aData(1, i) > nMaxNum Then nMaxNum = aData(1, i)
    Next
    ReDim aBucket(nMinNum * 100 To nMaxNum * 100), aData2(1 To UBound(aData), 1 To UBound(aData, 2))
    For i = 1 To UBound(aData, 2)
        aBucket(aData(1, i) * 100) = aBucket(aData(1, i) * 100) & "," & i
    Next
If r = 0 Then
    For i = nMinNum * 100 To nMaxNum * 100
                If aBucket(i) <> "" Then
            aBucket2 = Split(aBucket(i), ",")
            For k = 1 To UBound(aBucket2)
                n = n + 1
                For j = 1 To UBound(aData)
                    aData2(j, n) = aData(j, aBucket2(k))
                Next
            Next
        End If
    Next
ElseIf r = 1 Then
    For i = nMaxNum * 100 To nMinNum * 100 Step -1
        If aBucket(i) <> "" Then
            aBucket2 = Split(aBucket(i), ",")
            For k = 1 To UBound(aBucket2)
                n = n + 1
                For j = 1 To UBound(aData)
                    aData2(j, n) = aData(j, aBucket2(k))
                Next
            Next
        End If
    Next
End If
    BucketSort2 = aData2
End Function

songdg

自己想出来了
Function BucketSort2(aData, Optional r As Boolean = False)
    Dim i&, j&, aBucket(), nMinNum, nMaxNum, n&, t, aData2(), aBucket2
    t = 1: nMinNum = aData(1, 1): nMaxNum = nMinNum
    For i = 1 To UBound(aData, 2)
        If aData(1, i) < nMinNum Then nMinNum = aData(1, i)
        If aData(1, i) > nMaxNum Then nMaxNum = aData(1, i)
    Next
    ReDim aBucket(nMinNum * 100 To nMaxNum * 100), aData2(1 To UBound(aData), 1 To UBound(aData, 2))
    For i = 1 To UBound(aData, 2)
        aBucket(aData(1, i) * 100) = aBucket(aData(1, i) * 100) & "," & i
    Next
    If r Then nMinNum = temp: nMinNum = nMaxNum: nMaxNum = temp: t = -t
    For i = nMinNum * 100 To nMaxNum * 100 Step t
                If aBucket(i) <> "" Then
            aBucket2 = Split(aBucket(i), ",")
            For k = 1 To UBound(aBucket2)
                n = n + 1
                For j = 1 To UBound(aData)
                    aData2(j, n) = aData(j, aBucket2(k))
                Next
            Next
        End If
    Next
    BucketSort2 = aData2
End Function

yzxfelix

songdg 发表于 2017-3-20 16:51
谢谢帮助，我觉得现在的电脑内存根本不是问题，速度快才是重要。这只是我要排序的数据的一部分，我有3000 ...

您好，怎么联系啊，朋友？