Created sieve_of_eratosthenes.cpp - Githubissues

ishangoyal13 / fullstackDevelopment

Material & Projects related to full stack development

125 stars 207 forks source link

Created sieve_of_eratosthenes.cpp #465

Closed bilwa496 closed 3 years ago

bilwa496 commented 3 years ago

C++ program to print all primes smaller than or equal to n using Sieve of Eratosthenes with Time complexity of O(n*log(log(n)))

Description 📜

Please include a summary of the change and which issue is fixed. Please also include relevant motivation and context.
Fixes #
Sieve of Eratosthenes ALGORITHM

Type of change 📝

[x] Code
[ ] Documentation (Content Creation in the form of codes or tutorials)
[ ] Notes (Handwritten notes, cheatsheets, presentations, mind-maps)
[ ] Web Dev Projects
[ ] Others (If you choose other, Please mention changes below)

Programming Language

[ ] C#
[x] C++
[ ] Python
[ ] Java
[ ] Javascript
[ ] Others

Domain of Contribution 📊

[ ] Introduction
[ ] Data Structures
[x] Algorithms
[ ] Competitive Programming
[ ] Mathematics
[ ] Bit Magic
[ ] Recursion
[ ] Arrays
[ ] Searching
[ ] Sorting
[ ] Matrix
[ ] Hashing
[ ] String
[ ] Linked List
[ ] Stacks
[ ] Queue
[ ] Deque
[ ] Tree
[ ] Binary Search Tree
[ ] Heap
[ ] Graph
[ ] Greedy
[ ] Backtracking
[ ] Dynamic Programming
[ ] Trie
[ ] Segment Tree
[ ] Disjoint Set
[ ] Others

Checklist ✅

[x] I follow Contributing Guidelines & Code of conduct of this project.
[x] I have performed a self-review of my own code or work.
[x] I have commented my code, particularly in hard-to-understand areas.
[x] My changes generates no new warnings.

Screenshots / Gif (Optional) 📸