You might also learn today: https://en.wikipedia.org/wiki/Prime_number …
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Nice. One can also, of course, invoke the "just look at them" theorem. ;-)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Clever, but inefficient. The product grows exponentially in length of word, so need n operations on n bits. Faster to just sort in n log n.
-
The number of bits in the numeric representation grows at worst *linearly*, *not* exponentially with size of word.
End of conversation
New conversation -
-
-
Whole point of algorithms is to scale. And why not have something that applies to large inputs -- you never know when that'll come in handy.
-
For large inputs surely an array of 26 counters is faster (assuming Latin alphabet, though).
- 3 more replies
New conversation -
-
-
Integer products can become very large. A 64-bit unsigned integer cannot exceed 18,446,744,073,709,551,615 - 12-15 letter words can exceed
-
My language,
#prolog, allows integers that take up to 4 gig to represent.
End of conversation
New conversation -
-
-
Unicode makes this a big data problem

-
>The 1,114,112th prime is 17,379,959. whee
- 3 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.