Discussion on: Daily Challenge #184 - Form the Minimum

[divyansh-pratap]

this is solution in c . I have first sorted the array then solved it using simple logics . suggestions are welcome .

include

int sort(int A[] , int n );
int min(int A[] , int n);
int main()
{
int A[30];
int a , i , s;
printf("enter the number of elements you want to enter");
scanf("%d" ,&a);

for(i=0;i<a;i++)
{
    printf("enter the %dth element" , i+1);
    scanf("%d" , &A[i]);
}
s = min(A , a);
printf("/n %d" , s);

}
int sort(int A[] , int n )
{
int i;
int temp , j;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(A[j]<A[i])
{
temp=A[i];
A[i]=A[j];
A[j]=temp;
}
}
}
}

int min(int A[] ,int n)
{
int s , j=0 , k , i , l=1;

  sort(A , n);
  s=A[0];
  for(i=1;i<n;i++)
  {

    j=A[i];

    for(k=0;k<i;k++)
    {
        if(A[i]==A[k])
        {
         l=0;
          }
      }
    if(l==1)
    {
        s=s*10 + j;
      }

     l=1 ;

  }

  return s;

}