ADD file via upload

基数排序.cpp

@@ -0,0 +1,62 @@
+#include<stdio.h>
+#include<stdlib.h> 
+ 
+#define Max_ 10      
+#define RADIX_10 10    
+#define KEYNUM_31 10     
+ 
+
+void Show(int  arr[], int n)
+{
+    int i;
+    for ( i=0; i<n; i++ )
+        printf("%d  ", arr[i]);
+    printf("\n");
+}
+ 
+int GetNumInPos(int num,int pos)
+{
+ int temp = 1;
+ for (int i = 0; i < pos - 1; i++)
+  temp *= 10;
+    
+ return (num / temp) % 10;
+}
+
+void RadixSort(int* pDataArray, int iDataNum)
+{
+ int *radixArrays[RADIX_10];    
+ for (int i = 0; i < 10; i++)
+ {
+  radixArrays[i] = (int *)malloc(sizeof(int) * (iDataNum + 1));
+  radixArrays[i][0] = 0;    
+ }
+ 
+ for (int pos = 1; pos <= KEYNUM_31; pos++)    
+ {
+  for (int i = 0; i < iDataNum; i++)    
+  {
+   int num = GetNumInPos(pDataArray[i], pos);
+   int index = ++radixArrays[num][0];
+   radixArrays[num][index] = pDataArray[i];
+  }
+        
+  for (int i = 0, j =0; i < RADIX_10; i++)   
+  {
+   for (int k = 1; k <= radixArrays[i][0]; k++)
+    pDataArray[j++] = radixArrays[i][k];
+   radixArrays[i][0] = 0;    
+  }
+ }
+}
+ 
+int main()
+{   
+    int arr_test[Max_] = { 8, 4, 2, 3, 5, 1, 6, 9, 0, 7 };
+    
+    Show( arr_test, Max_ );
+    RadixSort( arr_test, Max_);
+    Show( arr_test, Max_ );
+    return 0;
+}
+