下述代码实现素数表的线性筛法 筛选出所有⼩于等于n的素数 横线上应填的最佳代码是( )

while j < len(primes) and j * primes[j] <= n:

while j < len(primes) and i * primes[j] <= n:

while j < len(primes) and j * primes[i] <= n:

while i < len(primes) and i * primes[j] < n: