Question

Give a linear (O(n)) time algorithm sorting n values in range 0..(n^3) − 1.

(Hint: represent a value x as (i, j, k) where x = i · (n^2) + j · n + k.)

Answer 1

#include<iostream>
using namespace std;
int main()
{
   int n,p,i,j;
   cout<<"Enter the value of n : ";
   cin>>n;
  
   cout<<"Enter the number of values you want to enter : ";
   cin>>p;
  
   int arr[n*n*n]={0};
  
   cout<<"Enter the value one by one : ";
   for(i=0;i<p;i++)
   {
       cin>>j;
       arr[j]=1;
   }
  
   cout<<"Sorted values are : ";
   for(i=0;i<n*n*n;i++)
   {
       if(arr[i]==1)
       cout<<i<<" ";
   }
}

Sample Output:-

F\Codes Untitled1.exe Enter the value of n 5 Enter the number of values you want to enter6 Enter the value one by one 87 24 5 89 120 1 Sorted values are 1 5 24 87 89 120 Process exited after 26.95 seconds with return value 0 Press any key to continue .