Steven Qu c8fbdee229
improved prime number generator to check only up to sqrt(n) instead of n (#1984)
* improved prime number generator to check only up to sqrt(n) instead of n

* added old version as slow_primes() and named new, faster version primes()

* fixed docstring in slow_primes

* Add a timeit benchmark

* Update prime_numbers.py

Co-authored-by: Christian Clauss <cclauss@me.com>
2020-05-15 00:33:50 +02:00
2020-05-04 11:18:41 +05:30
2020-05-02 21:13:56 +02:00
2019-10-18 08:13:58 +02:00
2020-01-18 13:24:33 +01:00
2020-01-18 13:24:33 +01:00
2020-05-10 20:49:40 +05:30
2020-05-06 03:32:40 +02:00
2020-04-07 23:56:21 +02:00
2020-05-14 16:52:43 +02:00
2020-05-06 03:32:40 +02:00
2019-11-17 19:37:58 +01:00
2020-05-10 08:06:42 +02:00
2020-04-17 20:03:36 +02:00
2020-04-13 02:17:29 +02:00

The Algorithms - Python

Gitpod Ready-to-Code Gitter chat  Build Status  LGTM  contributions welcome  Donate   

All algorithms implemented in Python (for education)

These implementations are for learning purposes. They may be less efficient than the implementations in the Python standard library.

Contribution Guidelines

Read our Contribution Guidelines before you contribute.

Community Channel

We're on Gitter! Please join us.

List of Algorithms

See our directory.

Languages
Python 99.9%
Shell 0.1%