flat assembler
Message board for the users of flat assembler.
![]() |
Author |
|
l4m2
Code: x = 1 shl (1 shl 28) y = 1 shl (1 shl 28) z = x*y Code: x = 1 shl (1 shl 18) y = 1 shl (1 shl 17) z = x/y |
|||
![]() |
|
revolution
I'm pretty sure that the multiply algorithm is O(n^2) also. It just has a smaller hidden C value.
Do you know of an O(n lg n) algorithm for precise integer division? |
|||
![]() |
|
Tomasz Grysztar
revolution wrote: I'm pretty sure that the multiply algorithm is O(n^2) also. It just has a smaller hidden C value. revolution wrote: Do you know of an O(n lg n) algorithm for precise integer division? |
|||
![]() |
|
revolution
Tomasz Grysztar wrote:
Tomasz Grysztar wrote:
|
|||
![]() |
|
l4m2
Code: D=9 B=pow(D, 10 000 000) ; 0.630680 s A=B*B ; 0.783547 s A=A/B ; 6.541880 s A=A+D ; 0.000001 s A=A*B ; 0.967101 s
|
|||||||||||
![]() |
|
Tomasz Grysztar
For fast big integer calculations please check out HeavyThing. It is free and open source.
|
|||
![]() |
|
l4m2
Tomasz Grysztar wrote: For fast big integer calculations please check out HeavyThing. It is free and open source. here |x| means the length of x. a+b=f: O(|f|) a-b=f: O(|a|+|b|) a*b=f: O(|f|lg|f|) or O(|a| |b|) a/b=f: O(|a|lg|a|) or O(|a| |b|) a^b=f: O(|f|lg|f|) |
|||
![]() |
|
l4m2
Quote: This should not really concern fasmg, |
|||
![]() |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2020, Tomasz Grysztar. Also on GitHub, YouTube, Twitter.
Website powered by rwasa.