Primality Test | Check for prime | Naïve + better approach | O(sqrt(N)) time | Notes 👇

Notes :- https://t.me/anujsonimca/17 In this lecture we will learn how you can find if a given number is prime or not in O(sqqrt(N)) time. Practice this :-https://practice.geeksforgeeks.org/problems/prime-number2314/1 tags & Keywords : check for prime,primality test,prime number logic,by anuj soni,DSA Course,in hindi,prime numer logic,check for prime number in sqrt(n) time,prime number program in C++,prime number,primality test by anuj soni,number theory for coding,coding,Prime Number gfg problem,prime numbers geeksforgeeks problem,prime number gfg practice