rsort1.cpp

来自「一本全面剖析C++数据结构算法的书籍」· C++ 代码 · 共 42 行

// rank or count sort

#include <iostream.h>

template<class T>
void Rearrange(T a[], int n, int r[])
{// Rearrange the elements of a into sorted order
 // using an additional array u.
   T *u = new T [n+1];
   // move to correct place in u
   for (int i = 0; i < n; i++)
      u[r[i]] = a[i];
   // move back to a
   for (int i = 0; i < n; i++)
      a[i] = u[i];
   delete [] u;
}

template<class T>
void Rank(T a[], int n, int r[])
{// Rank the n elements a[0:n-1].
   for (int i = 0; i < n; i++)
      r[i] = 0;  // initialize
   // compare all element pairs
   for (int i = 1; i < n; i++)
      for (int j = 0; j < i; j++)
         if (a[j] <= a[i]) r[i]++;
         else r[j]++;
}

void main(void)
{
   int a[6] = {2, 6, 4, 3, 1, 5};
   int r[6];
   int n = 6;
   Rank(a,n,r);
   Rearrange(a,n,r);
   for (int i = 0; i < n; i++)
      cout << a[i] << ' ';
   cout << endl;
}