
18 Mar
2010
18 Mar
'10
6:52 p.m.
Right now, the bottleneck of my program is in binarySearch', the function must be called a few billion times. Do you have any ideas on how to improve the performance of this function?
Bast solution for speeding up is to write it in assembler! Ragards, Andrey -- View this message in context: http://old.nabble.com/Performance-question-tp27949969p27950864.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.