Just an Intro ...
So..
This is my first blog and I am going to keep it updated with the latest coding and programming tips and Bugs.
You will be delighted to know that this blog will work as your life saver if you are a beginner and will help you become an expert in any field of programming and coding , be it C++, Java ,Python , Data Science , Machine Learning , competitive programming , you name it and you have it.
So Just go ahead and subscribe .
Your subscription will motivate me to help you get further interesting things.
So Lets dive in the first Interesting Algorithm ,
Sieve of Eratosthenes
This is my first blog and I am going to keep it updated with the latest coding and programming tips and Bugs.
You will be delighted to know that this blog will work as your life saver if you are a beginner and will help you become an expert in any field of programming and coding , be it C++, Java ,Python , Data Science , Machine Learning , competitive programming , you name it and you have it.
So Just go ahead and subscribe .
Your subscription will motivate me to help you get further interesting things.
So Lets dive in the first Interesting Algorithm ,
Sieve of Eratosthenes
picture credits : CP Algorithms
As Interesting as its Name , the algorithm reduces the time complexity of finding all prime numbers from 1 to N to merely log(n) . Interesting , uhh
Start from 2 , start striking off all further multiples of it , go to next unstriked number and start striking its multiples.
In the end you will be left with just prime numbers from 1 to N.
Easy and Interesting.
This is my first post so it has a little bit less content.
Stay tuned for a ton of interesting things .
Comments
Post a Comment