What is the mistake in my code deepak and prime

#1
#2

@shiva57reddy hey shiva reddy while making call pass 100000005 instead of 100.

#3

why you are passing 10000005 instead of 100?

#4

@shiva57reddy hey shiva because we’re storing the result upto this range.

#5

but i used recursion for that every time the prime is not found in that range iam increasing the size

#6

please reply to the doubt

#7

@shiva57reddy hey shiva your code logic is not so good in multiply the size by 2 your code stops before computation if you check for this case 1000000th prime number. your code stops before computing the result due to the counter variable when it equivalent to the input it returns whatever it computed yet your size is changing like 51200 then 102400 and it computes 653749 and what I did I have fixed the size to as 10000005 by hit and trial method which fix your range.
If you try to visualize your code print size and counter