how can i generate fastly the prime number upto 10 lakhs using seive of eratosthenise

directly from the wiki:

Input: an integer n > 1

Let A be an array of Boolean values, indexed by integers 2 to n,

initially all set to true.

```
for i = 2, 3, 4, ..., not exceeding √n:
if A[i] is true:
for j = i², i²+i, i²+2i, ..., not exceeding n :
A[j] := false
```

Output: all i such that A[i] is true.