http://www.cnblogs.com/kkun/archive/2011/11/23/2260299.html

http://www.cnblogs.com/eaglet/archive/2010/09/16/1828016.html

 

计数排序针对已知范围内的数字排序

public static void Sort(int[] A, out int[] B, int k)  {
int[] C = new int[k + 1]; B = new int[A.Length]; for (int j = 0; j < A.Length; j++) { C[A[j]]++; } for (int i = 1; i <= k; i++) { C[i] += C[i-1]; } for (int j = A.Length - 1; j >= 0; j--) { B[C[A[j]]-1] = A[j]; C[A[j]]--; } }

 

相关文章:

  • 2021-10-10
  • 2022-12-23
  • 2022-01-02
  • 2021-09-16
  • 2021-08-06
  • 2021-04-11
  • 2021-06-16
猜你喜欢
  • 2021-04-10
  • 2021-11-02
  • 2021-05-07
  • 2021-07-11
  • 2021-05-29
  • 2021-05-24
相关资源
相似解决方案