Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int []B=new int[300];
- int[]C= new int[k];
- for(int i=0;i<k;i++) {
- C[i]=0;
- }
- for(int j=1;j<A.length;j++) {
- C[A[j]]=C[A[j]]+1;
- }
- for(int i=1;i<k;i++) {
- C[i]=C[i]+C[i-1];
- }
- for(int j=A.length-1;j>0;j--) {
- B[C[A[j]]]=A[j];
- C[A[j]]=C[A[j]]-1;
- }
- for(int i=1;i<300;i++) {
- System.out.println(B[i]);
- }
- }
- public void RadixSort(int []A, int d) {
- for(int i=1;A[i]>0;i*=10) {
- countingSort(A,d);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement