I was given a problem to find out all the prime numbers within a range. Just after I wrote the program I found numerous other codes to solve the problem. I am interested to know is my algorithm efficient? Is it like sieve filtration? (before writing this code I had no clear idea on sieve filtration method) or the algorithm I used is a crap?

I was given a problem to find out all the prime numbers within a range. Just after I wrote the program I found numerous other codes to solve the problem. I am interested to know is my algorithm efficient? Is it like sieve filtration? (before writing this code I had no clear idea on sieve filtration method) or the algorithm I used is bad?

I was given a problem to find out all the prime numbers within a range.Just after I wrote the program I found numerous other codes to solve the problem.I am interested to know is my algorithm efficient?is it like sieve filtration?(before writing this code I had no clear idea on sieve filtration method)or the algorithm I used is a crap.:P

I was given a problem to find out all the prime numbers within a range. Just after I wrote the program I found numerous other codes to solve the problem. I am interested to know is my algorithm efficient? Is it like sieve filtration?  (before writing this code I had no clear idea on sieve filtration method) or the algorithm I used is a crap?