To my > > Because parsing from a decimal string is actually > > conversion of an natural number from the decimal system to binary > > [..] > > This leads to O( n*log(n)^2*(log(log(n))) ) < O( n*(log(n))^3 ) > > > > of which Waldek Hebish wrote recently. > > [..]
On Wed, Feb 15, 2012 at 04:24:27PM +0100, Waldek Hebisch wrote: > This method is implemented in GMP. For small n other methods are > faster, but above few thousends digits GMP uses Shoenhage-Strassen > method. > [..] > BTW: I have now commited new package containing a function > for parsing integers. When using sbcl it is much faster than > methods builtin into sbcl. When using GMP with sbcl it is > asymptotically fast, and also quite fast for small numbers. > This is great. My noise about fast parsing of a decimal integer was because from the start I erroneousely kept in mind that it is easy to write a program of something like O(n*log(n)), and with a small threshold. But the threshold occurs large. Regards, ------ Sergei [email protected] -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en.
