Finding Prime Numbers - Sieve Of Eratosthenes Program In Java | FREE DSA Course in JAVA | Lecture 11

Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - • Data Structures And Al...
We are up with the lecture 11 of our much awaited dsa course in java.
As we are moving ahead with the module of mathematics in our free dsa course, we are coming up with more interesting and complex problems which have high probability of coming in the interview rounds.
In the previous lecture 10 of our dsa course, we understood the logic behind writing a program for finding if a number is prime of not.
The next problem that we will be solving in this lecture is to find all the prime numbers between 1 to n where n is any natural number.
There is a simple approach to the same where you can call the isprime function and use it to check each number from 1 to n with the help of a loop.
The problem with this approach is it's time complexity and hence this approach of finding prime numbers in not efficient.
Hence we'll learn about a new algorithm known as Sieve Of Eratosthenes which is one of the quickest ways to find the prime numbers.
Let's see the implementation of this algorithm using a program in Java.
Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course.
For more information, fill this form: forms.gle/8eiUmM92Fx563Aen9
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacademy.com​
#dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder

[@sandeepraj2928]

The most underrated channel and lecturer i had seen in KZbin explaining .. just blown my mind what a lecturer surely loved it

[@HritikAhalawat]

truee, i have never seen a level of knowledge before this

[@jaynimje3790]

I don't usually comment on videos but I will now. The way you explained the concept is just amazing. Totally understood the concept. Thankyou so much sir.

[@Dare_Heart]

this is something I couldn't find this level of explanation any where over internet. Kudos

[@-Corvo_Attano]

I love this guy's teaching skills 👑

[@anubhabdannwffxythlq6364]

Just awesome.The presentation makes it really easy to understand.Loved it.

[@shaikhanis1532]

Sir the videos are very good , but please upload 2 or 3 videos per day

[@techtuber1344]

Sir this argument reality way of teaching makes understanding very easy , thanks :)

[@shabanansari7204]

Awesome explanation sir. Thank you so much😃🙏

[@nanitechviews8774]

I had a lot of confusion on where to learn dsa ..but I found the perfect course .. it's amazing 😍 TQ sir..

[@user-bu4rv9od7b]

so much satisfied with your explanation sir... Totally understood the concept... I am searching where to learn dsa... now i find the right one.. thank you so much sir....

[@user-rh1zk2fm7u]

This is incredible effect to create this type of environment, thank you so much for giving us such style to understand it , thank you much sir

[@HritikAhalawat]

above excellence i have just found your channel , and believe me it is good as any paid course. lots of love brother❤

[@user-rh1zk2fm7u]

i follow all this content because i have understand it very well and its very easy to write the code , Thank you sir😊😊❤❤❤❤❤❤

[@arbaz8950]

Sir, here time complexity will be O(n) because in the end we are traversing the entire array

[@arbazahmadkhan9128]

Amazing sir🔥

[@bogus3007]

Instant sub -- looking forward to watching more videos

[@hrithikrudra4292]

Awesome 👍👍

[@user-fm6wd5xi7l]

Very good teacher🎉🎉❤

[@manjitKK]

Sir please make your dsa sheet for interviews i would love to solve it And sir your solution and the way you explain are just mind-blowing I have never seen such content on entire KZbin, I m pretty confident about it because I have solved 100+ LeetCode questions so I have been through so many explanations till date.

[@BattulaChaitanya-sz4hv]

good explaining

[@jai2240]

Super understandable vedio

[@thellaidhinesh8646]

awesome video bro

[@sreenijanarayana8468]

ur channel is surely underrated

[@immortalveejay]

superb

[@ohh__drag5712]

too good....

[@why_me50]

nice

[@HANUMAGANGADHARKottapalli]

Thanks so much for this :)

[@TAPACADEMY]

Glad it was helpful!

[@OODevelopers]

Hi sir, your explination is wonderful . Came across your videos while searching for datastructures. I was looking for tree and graph datastructures but could not find them here.any videos available on tree and graph ?

[@user-rh1zk2fm7u]

deep leaning❤❤❤❤❤❤❤❤😊😊

[@rahulpundir4915]

so soo great accha kaam

[@TAPACADEMY]

Thanks

[@SHAIKMOHAMMADAYESHA]

Sir, since to print all the prime numbers we need a loop from starting to n wouldn't that make the time complexity of this O(n)

[@jamitireddidamodararao9051]

Sir please upload even 2 videos daily

[@vaishnavikadam1913]

Just a suggestion, you can avoid moving in your videos because it's causing distraction. Great presentation and explanation. Thank you.

[@sivakumarr3517]

Sir if possible release two videos on weekends

[@inshort2812]

koi batye ga ye n+1 kyu kr rhe hai boolean mai

[@saishanmukh7516]

Array is from 0 to n So length is 1(for 0)+1 to n Which is n+1

[@charizard782]

Sir the videos are very good , but please upload 2 or 3 videos per day .

[@MrMax-ft9zw]

😂😂😂