My function is running fine for small no but not for big no.Can anybody explain?

2 visualizaciones (últimos 30 días)
function k=next_prime(n)
k=2;
while(k>2)
if(isprime(k)==1)
if(k>n)
return
else
k=k+1;
end
else
k=k+1;
end
end

Respuesta aceptada

DGM
DGM el 25 de Sept. de 2021
Editada: DGM el 25 de Sept. de 2021
Consider:
a = next_prime(17560)
a = 17569
b = next_prime(5346551)
b = 5346571
function k = next_prime(n)
k = n;
while true
if isprime(k)
break;
end
k=k+1;
end
end
  3 comentarios
Walter Roberson
Walter Roberson el 25 de Sept. de 2021
Editada: Walter Roberson el 25 de Sept. de 2021
What is an example of an input that it gives the wrong answer for?
Your code is slow. There is no point in testing any number that is lower than the input, n, because it does not matter if any of them are prime: all that matters is starting from n . And making sure that you carefully define what is intended to happen if the input is already a prime.
Nishant Raj
Nishant Raj el 25 de Sept. de 2021
Ok,got it,my code is slow,thats why its taking a lot more time for big inputs.

Iniciar sesión para comentar.

Más respuestas (0)

Categorías

Más información sobre Loops and Conditional Statements en Help Center y File Exchange.

Productos


Versión

R2021a

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by