Private Sub qsort(ByRef a() As Single, ByRef b() As Single, ByVal m As Integer, ByVal n As Integer)
Dim i, j As Integer
Dim temp, k As Single
   
  If (m < n) Then
    i = m
    j = n   1
    k = a(m)
    Do
      
      Do
        'If i > 2048 Then Stop
        i = i   1
      Loop Until (a(i) >= k) Or (i >= n)
      Do
        j = j - 1
      Loop Until (a(j) <= k) Or (j <= 1)
      If (i < j) Then
        
        temp = a(i)
        a(i) = a(j)
        a(j) = temp
        
        temp = b(i)
        b(i) = b(j)
        b(j) = temp
        
      End If
    Loop Until (i >= j)
    
    temp = a(m)
    a(m) = a(j)
    a(j) = temp
    
    temp = b(m)
    b(m) = b(j)
    b(j) = temp
    
    
    If (m < j - 1) Then
      Call qsort(a(), b(), m, j - 1)
    End If
    If (j   1 < n) Then
      Call qsort(a(), b(), j   1, n)
    End If
  End If
  
End Sub 

 
void qsort(int a[],int b[], int m,int n)
{
  int i,j,k,temp;
  if (m < n)
  {
    i = m;
    j = n   1;
    k = a[m];
    do
    {
      do
      {
        if (i > 2048)
          i  ;
      }while( (a[i] >= k) || (i >= n) );
      do
      {
        j--  ;
      }while( (a[j] <= k) || (j <= 1) );          if (i < j)
      {
        temp = a[i];
        a[i] = a[j];
        a[j] = temp;            temp = b[i];
        b[i] = b[j];
        b[j] = temp;
      }        }while(i >= j);        temp = a[m];
    a[m] = a[j];
    a[j] = temp;        temp = b[m];
    b[m] = b[j];
    b[j] = temp;        if (m < j - 1)
    {
      qsort(a, b, m, j - 1);
    }
    if (j   1 < n)
    {
      qsort(a, b, j   1, n) ;
    }
  }
}