I have been given some algorithms to reverse engineer. The algorithm below is a radix sort, but I am very confused about what is actually happening in the code.
/*try this iterative method and 100% working*/
#include
#include
int sort();
int display();
long int a[20],n;
int main(){
int i;
printf("enter the size:");
scanf("%d",&n);
printf("\nenter the array elements\n");
for(i=0;i