Results for Exercise Sheet 3 (List Intersection)
Please read the instructions below, before adding something to the table!
Add your row to the table below, following the examples already there. Simple = the simple linear-time algorithm. ExpBin = the asymptotically optimal exponential-binary-search algorithm. R = the ratio of the list length. The sum of the two list lengths should be N=250M in both cases (so 1/(R+1)*N for the smaller list, and R/(R+1)*N for the larger list). Provide the query times in seconds (s) please, with exactly one digit after the dot. Provide your machine specs in the same way as the examples already there. In particular, specify the processor frequency with exactly one digit after the dot, the amount of RAM as an integer, and don't provide secondary details about the processor.
Name |
Simple, R = 5 |
ExpBin, R = 5 |
Simple, R = 50 |
ExpBin, R = 50 |
Processor / RAM |
Language |
Florian B |
0.4s |
0.5s |
0.4s |
0.2s |
Intel X5560 @ 2.8GHz / 36 GB |
Java |