aaahsheeesh/The-Sieve-of-Eratosthenes aaahsheeesh/The-Sieve-of-Eratosthenes

  • Stars
    star
    2
  • Language
    Python
  • Created about 6 years ago
  • Updated about 6 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
aaahsheeesh/The-Sieve-of-Eratosthenes
github

aaahsheeesh

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

The Sieve of Eratosthenes is one of the most popular methods for finding and counting prime numbers within a range. The reason for its popularity is, as you can guess, its speed.

More Repositories

1

binary-search-with-insertion-sort

Python
3
star
2

ansible-k8-cluster

This Project holds the ansible scripts to setup k8- cluster in Rhel/linux servers
2
star
3

pigeonhole-sorting

pigeonhole sorting has the most unique way of sortifying the elements , yeah and you can check it in my code
Python
2
star
4

DrinkAndDelight-mockito

Java
1
star
5

snort-an-open-source-NIPS

we modified the snort NIDS to NIPS
1
star
6

thompsons-algo-

this algo converts NFA to DFA
C
1
star
7

ashishbhardwaj354.github.io

HTML
1
star
8

aerinve.io

HTML
1
star
9

amiriaj-opticals

HTML
1
star
10

java_assignment

Java
1
star
11

optical

JavaScript
1
star
12

regular-expression-to-NFA

this is a c program to convert the regular expression in non deterministic finite automata (NFA) , the limitation of the program is it take max up to 10 states.
C
1
star