Talk:Square form factorization: Difference between revisions
→Raku (ping Hkdtam): pathetic excuses on sloppiness ..
(→Raku (ping Hkdtam): pathetic excuses on sloppiness ..) |
|||
Line 208:
=== Raku (ping Hkdtam) ===
There is something ''very'' wrong with (the performance of) the Raku example. I know Raku is the slowest computer language ever written (don't worry I'm just kidding) but... Seriously, just copy (say) the 2nd C example into (say) repl.it and run it. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 23:39, 25 March 2021 (UTC)
: Hi Pete, thank you for bringing this up. I was just trying to be playful on making it look as close to the algorithm and pseudocode as possible, for example, the floor and sqrt routines were replaced with operators which add unnecessary layers of operation. Also many recalculation of values like √𝑁, √(𝑘*𝑁) and √Q, among others, can be avoided by using temporary variables. Above all that I didn't apply any optimization like the other entries (TBH I am too slack to understand them and fit them in :-P). Anyway, thanks again and have a nice day. --[[User:Hkdtam|Hkdtam]] ([[User talk:Hkdtam|talk]]) 17:37, 26 March 2021 (UTC)
| |||