@rheolism
Nice algorythm.
Setting the memory locations to -1 makes the last IF quicker as it's implicit true rather than =0, and as there are more misses than hits adding B% to the loop then subtracting it from the number printed is faster than adding B% to every lookup. Saving about 2.34 seconds.
Edit: Oops, that introduces an error that prints several false positives. Too tired to work out why right now.
Edit 2: The memory on tbe beeb isn"t initialised fully empty. Thats why.
=> More informations about this toot | View the thread | More toots from geoffl@mastodon.me.uk
=> View rheolism@oldbytes.space profile
text/gemini
This content has been proxied by September (3851b).