User:Yeti: Difference between revisions
Content added Content deleted
No edit summary |
(→Primes) |
||
Line 3: | Line 3: | ||
---- |
---- |
||
=Arithmetic/Complex= |
|||
==Dc== |
|||
WIP! |
|||
=Primes= |
=Primes= |
||
==Python== |
==Python== |
||
{{works with|Python|2.x}} |
{{works with|Python|2.x}} |
||
This is a sequentialised variant of the well known sieve method (ab)using a dictionary as sparse array. |
|||
<lang python>L = {} |
<lang python>L = {} |
||
n = 2 |
n = 2 |
Revision as of 18:39, 24 February 2019
My Sandbox
I need to get used to this flavour of markup first. That'll take some time. Meanwhile I collect my examples here. If you think, some example is worth being moved to the "right" place, feel free to do so and leave me a note...
Arithmetic/Complex
Dc
WIP!
Primes
Python
This is a sequentialised variant of the well known sieve method (ab)using a dictionary as sparse array. <lang python>L = {} n = 2
while 1:
if n in L: P = L[n] del L[n] # optional - just saves some memory. else: print n P = [n]
for p in P: npp = n+p if npp in L: L[npp].add(p) else: L[npp] = set([p])
n += 1</lang>
- Output:
2 3 5 7 11 13 17 19 23 29
...the program has to be terminated by the user e.g. by typing ctrl-c.
My Favorite Languages | |
Language | Proficiency |
AWK | --- |
C | --- |
Dc | --- |
Spin | --- |