Re^5: Algorithm for cancelling common factors between two lists of multiplicands

For this matrix, I can compute the exact P_cutoff in about 1 second (on a 1.6-GHz Celeron laptop). How long does the brute-force approach take?

[thor@arinmir fishers-exact-test]$ cat ex1.dat
989 9400
43300 2400

[thor@arinmir fishers-exact-test]$ time ./fet < ex1.dat > /dev/null
real    0m1.007s
user    0m0.991s
sys     0m0.012s
[download]

Tom Moertel : Blog / Talks / CPAN / LectroTest / PXSL / Coffee / Movie Rating Decoder

Comment on Re^5: Algorithm for cancelling common factors between two lists of multiplicands Download Code

Replies are listed 'Best First'.
Re^6: Algorithm for cancelling common factors between two lists of multiplicands by BrowserUk (Patriarch) on Aug 08, 2005 at 23:20 UTC
The results would be interesting? Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal? "Science is about questioning the status quo. Questioning authority". The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.	[reply] [d/l]
Re^7: Algorithm for cancelling common factors between two lists of multiplicands by tmoertel (Chaplain) on Aug 08, 2005 at 23:36 UTC
The P_cutoff value is very small and is represented by a 13-kB ratio (numerator%denominator): Read more... (24 kB) Tom Moertel : Blog / Talks / CPAN / LectroTest / PXSL / Coffee / Movie Rating Decoder	[reply] [d/l]


XP is just a number
	PerlMonks