Yahoo Interview Question
Software Engineer / Developers/*A suggested solution,check it if wrong, comment on it*/
#include<stdio.h>
int prime(int);
int main() {
int n, next;
printf("enter a given prime no:\n");
scanf("%d", &n);
next = prime(n);
printf("\nNext prime is:%d", next);
}
int prime(int x) {
int a=x+1, flag=0;
for (int i=2; i<=x; i++)
for ( int j=2; j<=x; j++) {
if (a%j == 0) {
a = a + 1;
continue;
}
}
return a;
}
/*---------------------To find next prime no in java --------------*/
public class NextPrime {
boolean flag=true;
int i=1;int next = 0;
while(flag!=false)
{
next=n+i;
if(next==2)
{
flag=false;
break;
}
if(next%2==0)
{
flag=true;
}
else
{
flag=false;
}
i++;
}
System.out.println("Next Prime Number is :"+next);
}
public static void main(String[] args) throws NumberFormatException, IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.print("Please enter the number : ");
int number=Integer.parseInt(br.readLine());
NextPrime p=new NextPrime();
p.nextPrime(number);
}
}
/*A suggested solution,check it if wrong, comment on it*/
- braj September 24, 2010#include<stdio.h>
#include<conio.h>
int prime(int);
int main()
{int n,next;
clrscr();
printf("enter a given prime no:\n");
scanf("%d",&n);
next=prime(n);
printf("\nNext prime is:%d",next);
}
int prime(int x)
{int a=x+1,flag=0;
for(int i=2;i<=x;i++)
for( int j=2;j<=x;j++)
{ if(a%j==0)
{
a=a+1;
continue;
}
}
return(a);
}