Lecture 18 - Check For Prime | DSA Basics For Beginners | Placement Course
Welcome to Lecture 18 - Check For Prime of our DSA Placement Course. In this lecture, we will get an understanding of Prime Numbers and how to implement them in coding.
How do you check if a number is prime in algorithms?
To check whether a given number N is prime or not, We have to check if number is divisible by any number from 2 to N-1. If it is not divided by any number then it is a prime number else it is not a prime number.
This Data Structures and Algorithms course is a part of our Data Structures and Algorithms playlist: • Video
🔗Follow Us:
Our Website: https://myprojectideas.com/
Github: https://github.com/myprojectideas/DSA...
Join this channel to get access to the perks like 1-to-1 error resolution:
/ @myprojectideas
#dsa #algorithm #Prime #placement #course #coding
