[Mono-bugs] [Bug 68723][Nor] Changed - Performance on long arith

bugzilla-daemon@bugzilla.ximian.com bugzilla-daemon@bugzilla.ximian.com
Mon, 25 Oct 2004 12:03:17 -0400 (EDT)

Please do not reply to this email- if you want to comment on the bug, go to the
URL shown below and enter your comments there.

Changed by writeonlymemory@gmail.com.


--- shadow/68723	2004-10-25 11:20:24.000000000 -0400
+++ shadow/68723.tmp.24989	2004-10-25 12:03:17.000000000 -0400
@@ -160,6 +160,16 @@
 don't think it is possible to do this in a cross platform way. Is 
 there any way we could generate the code in a .s file and then safely 
 call it without the icall stuff?
 Maybe its best to first work on the [%/] by two, which can probably 
 be more xplatform.
+------- Additional Comments From writeonlymemory@gmail.com  2004-10-25 12:03 -------
+Paolo: I am well aware of the fact that an O(log n) algorithm is
+supposed to perform better only asymptotically, and I'm aware of the
+constant factors -- I'm *not* an academic ;) BUT, my point here is that:
+a) The same code written in C the log n method performs better even
+for small n
+b) The same code running in the Microsoft environment the log n method
+performs better even for small n