mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fixes in 2001/ollinger

Browse Source 
Format/typo check README.md.

The bug status in the README.md was also incorrect.
This commit is contained in:
Cody Boone Ferguson committed 2023-11-16 08:58:22 -08:00
1 parent cc04c505a3
commit 0496a69ca5
1 file changed
+7 -3
Download Patch File Download Diff File Expand all files Collapse all files
2001/ollinger/README.md
+7 -3
View File
@@ -10,7 +10,7 @@ make
The current status of this entry is: The current status of this entry is:
``` ```
STATUS: known bug - please help us fix STATUS: INABIAF - please **DO NOT** fix
``` ```
For more detailed information see [2001 ollinger in bugs.md](/bugs.md#2001-ollinger). For more detailed information see [2001 ollinger in bugs.md](/bugs.md#2001-ollinger).
@@ -49,6 +49,7 @@ Do get lost in the programs line of thought! :-)
## Author's remarks: ## Author's remarks:
### What's this? ### What's this?
What do you see? On the left, you will see an enumeration of all successive What do you see? On the left, you will see an enumeration of all successive
@@ -58,13 +59,15 @@ primes. The big diagonals from right to left are used to erase composed numbers.
When no diagonal crosses a number, then the left cell take value 1 and the When no diagonal crosses a number, then the left cell take value 1 and the
number is prime. number is prime.
The parallel version of this algorithm works in real time n. This C The parallel version of this algorithm works in real time `n`. This C
sequential version is slower as it works in `O(n*log n)`. But you have some sequential version is slower as it works in `O(n*log n)`. But you have some
nice picture instead... the cost is a constant number of operation for each nice picture instead... the cost is a constant number of operation for each
character printed on the screen. character printed on the screen.
### Why did I write this ? ### Why did I write this ?
Let's just quote the [FAQ](/faq.md): Let's just quote the [FAQ](/faq.md):
Q: Are there types of entries that are submitted so frequently that the Q: Are there types of entries that are submitted so frequently that the
@@ -107,6 +110,7 @@ Unbeaten for 12 years and counting...
I think this is enough motivation for trying to submit a program which uses I think this is enough motivation for trying to submit a program which uses
some complex state machine/table to generate small primes and print them. some complex state machine/table to generate small primes and print them.
### The way it works ### The way it works
This program simply prints the space-time diagram of some particular This program simply prints the space-time diagram of some particular
@@ -116,7 +120,7 @@ It is an optimization of an old automaton for recognizing primes designed
by [Fischer](http://richardallenfischer.com) in 1965. by [Fischer](http://richardallenfischer.com) in 1965.
The table of the automaton is encoded into the string `e` and consists of The table of the automaton is encoded into the string `e` and consists of
345 transitions of the kind ff(left,middle,right)`. This encoding into `e` 345 transitions of the kind `ff(left,middle,right)`. This encoding into `e`
is obfuscated to reduce its size, restrict it to characters 32 to 127 and is obfuscated to reduce its size, restrict it to characters 32 to 127 and
guarantee a constant time. guarantee a constant time.