you can see the the program with output.. here
include<stdio.h> void radix(int a[],int n) { int i,j,k=1,l,temp,b[10][n],cnt; int max=a[0],c=0; for(i=0;i<n;i++) if(a[i]>max) max=a[i]; while(max%10) { c++; max/=10; }...
If the range of numbers is 1....n and the size of numbers is k(small no.) then the time complexity will be theta n log..
These are basically the instructions written in plain English to solve any problem. It makes a layman understand the complexity of the problem. Pseudo is a way of describing and algorithm without...
quick sort is better,bcoz it doesn't take extra space of memory...