'reAdjust all "higher than x" elements in array, make room for new elementOption Compare Database
Option Explicit
Private Function QuickSortR(a() As String, low As Long, high As Long)
Dim middle As Long
Dim pivot As String
Dim i As Long
Dim j As Long
' Sort low, middle, high
middle = (low + high) / 2
If a(middle) < a(low) Then Call SwapReferences(a, low, middle)
If a(high) < a(low) Then Call SwapReferences(a, low, high)
If a(high) < a(middle) Then Call SwapReferences(a, middle, high)
' base case
If high - low < 2 Then Exit Function
' Place pivot at position high-1
Call SwapReferences(a, middle, high - 1)
pivot = a(high - 1)
' Begin partitioning
j = high - 1
i = low
Do
Do
i = i + 1
Loop While (a(i) < pivot)
Do
j = j - 1
Loop While (pivot < a(j))
If i < j Then
Call SwapReferences(a, i, j)
Else
Exit Do
End If
Loop
' Restore pivot
Call SwapReferences(a, i, high - 1)
Call QuickSortR(a, low, i - 1) ' sort small elements
Call QuickSortR(a, i + 1, high) ' sort large elements
End Function
Public Function QuickSort(a() As String)
Call QuickSortR(a, 0, UBound(a))
End Function
Private Function SwapReferences(a() As String, low As Long, high As Long)
Dim tmp As String
tmp = a(high)
a(high) = a(low)
a(low) = tmp
End FunctionPrivate Function QuickSortR(a() As String, ColumnIndex As Long, low As Long, high As Long)
Public Function QuickSort(a() As String, ColumnIndex As Long)Dim objSort As clsQuickSort
Set objSort = New clsQuickSort
Call objSort.QuickSort(myArray)
