Question

Design an algorithm (code in C) that decomposes a natural number into its figures: units, tens, hundreds ... and you store them in a table in reverse,

Empty places will be filled with zeros.

First, you need to determine the size of the table, keeping in mind that the largest natural number that can be represented is: 2 ^ 32 - 1 = 4294967295.

Answer 1

#include <stdio.h>
int main()
{
   int table[10];
   /*max size of the table will be 10
   since largest natural number can be represnted using 10 digits*/

   int n,m,i=0,j,rem;
  
   // inializing the table with zero
   for(j=0;j<10;j++){
       table[j]=0;
   }
   printf("Enter the natural Number ");
   scanf("%d",&n);
   m=n;   //temporarily storing the value
   while(m!=0)
   {
      
       rem=m%10; // extracting each digit
       table[i]=rem; // storing the data in the array(table) which acts as a queue
      
       /* ones digit will be stored in the first of the array
       therefore we are storing the data in the reverse order*/
       i++;
       m=m/10;
       rem=0;
              
   }
   //printing the number in the reverse order
   // since we have stored the number in reverse order in the array
   //printing array from the beggining will provide us the number in the reverse form
  
   printf("\n\nNumber in reverse order\n");
   for(j=0;j<i;j++)
   {
       printf("%d",table[j]);
   }
  
   /*note
   to print the full table with all 0 also.
   in for j loop, modify the condition as j<10 since
   the size of the table is 10
   */
return 0;
}