contest questions
Hi,
The contest is an excellent idea Rob.
I can see alot of discussion re: optimisation and algoritms after the
contest is over.
* Obviously the anonymous donor wants to stay "anonymous" ... why?
I can't think of any reason why the donor doesn't want to be known.
(If it was me I'd want everyone to know I donated it!!!!)
* Is the time to load the database part of the calculated time to
decipher the sentence? If it is can we re-organise the database in a
particular order to help the load time.
ie. if we create some new hash scheme can we re-order the table to
make the load time faster and therefore reduce total decipher time.
* Just to get my brain working I did the "easy" contest.
(60 lines of code executing in 0.05 seconds! - ok I haven't done any
optimisations :( )
How do we calculate total time of execution???
Is this correct?
----------
atom t
t = time()
...
do all processing
...
printf(1, "Total Time=%f\n", time() - t)
----------
Will you add this to everyone's code or should we do this?
With this above method the execution time seems to vary greatly using
"ex" under Win98 using the same data.
What methods (OS's?) will be used to do the offical benchmarks?
Thanks,
Ray Smith
http://rays-web.com
|
Not Categorized, Please Help
|
|
