SHOW:
|
|
- or go back to the newest paste.
| 1 | #include <stdio.h> | |
| 2 | #include <stdlib.h> | |
| 3 | - | |
| 3 | + | int main(void) |
| 4 | - | int main(void) {
|
| 4 | + | {
|
| 5 | - | |
| 5 | + | int n, i, j, passes, digit, x = 1, k; |
| 6 | - | int n , i , j , passes , digit , x = 1 , k; |
| 6 | + | int ar[100]; |
| 7 | - | |
| 7 | + | printf("enter number of values: ");
|
| 8 | - | |
| 8 | + | scanf( "%d",&n); |
| 9 | - | int ar[100]; |
| 9 | + | |
| 10 | - | |
| 10 | + | for(i=0; i<n; i++)ar[i]=rand()%1000; //scanf(" %d",&ar[i]);
|
| 11 | - | printf("enter number of values: ");
|
| 11 | + | printf("before sort:\n");
|
| 12 | - | |
| 12 | + | for(i=0; i<n; i++)printf(" %d",ar[i]);
|
| 13 | - | scanf( "%d",&n); |
| 13 | + | printf("\n");
|
| 14 | for(passes=1; passes<=3; passes++) | |
| 15 | - | |
| 15 | + | {
|
| 16 | - | for(i=0;i<n;i++)ar[i]=rand()%1000;//scanf(" %d",&ar[i]);
|
| 16 | + | int table[10][n]; |
| 17 | - | |
| 17 | + | for(i=0; i<=9; i++) |
| 18 | - | printf("before sort:\n");
|
| 18 | + | {
|
| 19 | - | for(i=0;i<n;i++)printf(" %d",ar[i]);
|
| 19 | + | for(j=0; j<n; j++) |
| 20 | - | printf("\n");
|
| 20 | + | {
|
| 21 | - | |
| 21 | + | table[i][j]=-9999; |
| 22 | - | for(passes=1;passes<=3;passes++){
|
| 22 | + | } |
| 23 | - | int table[10][n]; |
| 23 | + | } |
| 24 | - | for(i=0;i<=9;i++){
|
| 24 | + | for(i=0; i<n; i++) |
| 25 | - | for(j=0;j<n;j++){
|
| 25 | + | {
|
| 26 | - | table[i][j]=-9999; |
| 26 | + | digit=(ar[i]/x)%10; |
| 27 | - | } |
| 27 | + | table[digit][i]=ar[i]; |
| 28 | - | } |
| 28 | + | } |
| 29 | - | for(i=0;i<n;i++){
|
| 29 | + | k=0; |
| 30 | - | digit=(ar[i]/x)%10; |
| 30 | + | for(i=0; i<=9; i++) |
| 31 | - | table[digit][i]=ar[i]; |
| 31 | + | {
|
| 32 | - | } |
| 32 | + | for(j=0; j<n; j++) |
| 33 | - | k=0; |
| 33 | + | {
|
| 34 | - | for(i=0;i<=9;i++){
|
| 34 | + | if(table[i][j]!=-9999) |
| 35 | - | for(j=0;j<n;j++){
|
| 35 | + | {
|
| 36 | - | if(table[i][j]!=-9999){
|
| 36 | + | ar[k]=table[i][j]; |
| 37 | - | ar[k]=table[i][j]; |
| 37 | + | k=k+1; |
| 38 | - | k=k+1; |
| 38 | + | } |
| 39 | - | } |
| 39 | + | } |
| 40 | - | } |
| 40 | + | } |
| 41 | - | } |
| 41 | + | x*=10; |
| 42 | - | x*=10; |
| 42 | + | } |
| 43 | - | } |
| 43 | + | printf("after sort:\n");
|
| 44 | - | |
| 44 | + | for(i=0; i<n; i++)printf(" %d",ar[i]);
|
| 45 | - | printf("after sort:\n");
|
| 45 | + | printf("\n");
|
| 46 | - | for(i=0;i<n;i++)printf(" %d",ar[i]);
|
| 46 | + | return 0; |
| 47 | - | printf("\n");
|
| 47 | + |