Question

You are given an array of integers, where different integers may have different numbers of digits but the total number of digits over all integers in the array is n. Show how to sort the array in increasing order in O(n) time. Note: The number of integers in the array can be different for same value of n - for example the array with 2 integers 2468 and 12345 has 9 digits as well as the array with 5 integers 2, 46, 207, 33 and 9. Of course the sorted version of these arrays are 2468, 12345 and 2, 9, 33, 46, 207 respectively.

Answer 1

#include<iostream>

using namespace std;

int main()
{
    int i,j,temp,a[50],size,n;
    cout<<"Enter array size( Max:50 ) :: ";
    cin>>size;
cout<<"\nEnter array elements :: \n";

for(i=0; i<size; i++)
{
     cout<<"\nEnter arr["<<i<<"] Element :: ";
  cin>>a[i];
}

cout<<"\nBefore Sorting Array :: \n\n";

for(i=0;i<size;i++)
{
cout<<" "<<a[i]<<" ";
}

for(i=0;i<size;i++)
{
     for(j=0;j<size-i-1;j++)
     {
         if(a[j]>a[j+1])
         {
             temp=a[j];
             a[j]=a[j+1];
             a[j+1]=temp;
         }
     }
}

cout<<"\n After Sorting Array :: \n\n";

for(i=0;i<size;i++)
{
cout<<" "<<a[i]<<" ";
}

cout<<"\n";

return 0;

}