http://blog.csdn.net/feixiaoxing/article/details/6876831
基数排序:
205 int getnumInPos(int a, int pos)
206 {
207 int temp = 1;
208 for ( int i = 0; i < pos -1; i++)
209 temp * = 10;
210 return (num/temp)%10;
211 }
212
213 void radixSort(int a[], int length)
214 {
215 int *b[10];
216 for (int i = 0; i < 10; i++) {
217 b[i] = new int [length + 1];
218 b[i][0] = 0;
219 }
220 for (int i = 1; i < 31; i++) {
221 for (int j = 0; j < length; j++) {
222 int num = getNumInPos(a[j], i);
223 int index = ++b[num][0];
224 b[num][index] = a[j];
225 }
226 int k = 0;
227 for (int i = 0; i < 10; i++) {
228 for (int j = 1; j <= b[i][0]; j++) {
229 a[k++] = b[i][j];
230 }
231 b[i][0] = 0;
232 }
233 }
234 }
计数排序:
138 void Sort::countSort(int a[], int b[], int k)
139 {
140 int* mid = new int[k + 1];
141 for (int i = 0; i < k; i++)
142 mid[i] = 0;
143
144 for (int i = 0; i < size; i++)
145 mid[a[i]]++;
146
147 for (int i = 1; i <= k; i++)
148 mid[i] += mid[i-1];
149
150 for (int i = size-1; i >= 0; i--) {
151 b[mid[a[i]]-1] = a[i];
152 mid[a[i]]--;
153 }
154 delete []mid;
155 }