LeetCode 204. Count Primes | JSer - JavaScript & Algorithm

preview_player
Показать описание
the approach is not difficult, but the time complexity is hard to understand.
I haven't understand it yet.

anyway it is said to be O(nloglogn)

Hi I'm a JavaScript engineer who is not good at algorithms,
and currently practicing leetCode online. If you are interested, maybe we can learn together.
Рекомендации по теме
Комментарии
Автор

Hey there, could I ask what does the if(!isPrime[i]) part do? Thanks.

miabunny