So, I finally got PS1 working correctly. But, I was wondering how I might be able to improve it to make the code more efficient. Aside from PS0, this was my first real program, and I want to learn how to make it as efficient as possible.
prime_count = 1
current_number = 3
current_prime = 2
divisor = 2
desired_prime_count = raw_input('Which nth prime do you want to find?')
desired_prime_count = int(desired_prime_count)
while prime_count < desired_prime_count:
if current_number % 2 == 0:
current_number += 1
else:
if current_number % divisor > 0:
divisor += 1
elif current_number % div

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.