#include<stdio.h>
void main()
{
int i,j,n,a[15],count=0,b;
printf("Enter the size of array:\n");
scanf("%d",&n);
printf("Enter the array element :\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for (j = i + 1; j < n; ++j)
{
if (a[i] < a[j])
{
b = a[i];
a[i] =a[j];
a[j] = b;
}
}
}
for(i=0;i<n;i++)
{
for(j=2;j<a[i]/2;j++)
{
if(a[i]%j==0)
count=1;
else
count=0;
}
if(count==0)
{
printf("largest prime number is:%d",a[i]);
break;
}
}
}
void main()
{
int i,j,n,a[15],count=0,b;
printf("Enter the size of array:\n");
scanf("%d",&n);
printf("Enter the array element :\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for (j = i + 1; j < n; ++j)
{
if (a[i] < a[j])
{
b = a[i];
a[i] =a[j];
a[j] = b;
}
}
}
for(i=0;i<n;i++)
{
for(j=2;j<a[i]/2;j++)
{
if(a[i]%j==0)
count=1;
else
count=0;
}
if(count==0)
{
printf("largest prime number is:%d",a[i]);
break;
}
}
}
Comments
Post a Comment