AD Teaching Wiki:

Results for Exercise Sheet 3 (List Intersection)

Please read the instructions below, before adding something to the table!

1. Add your row to the table below, following the examples already there. Simple = the simple linear-time algorithm. Gallop = the asymptotically optimal galloping-search algorithm.

2. Provide the query times in microseconds (µs), and round them to the next integer.

3. Provide the programming language and the specs of the machine you used 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

university german

university berlin

university freiburg

simple

gallop

simple

gallop

simple

gallop

Processor / RAM

Language

Björn

100µs

200µs

100µs

100µs

100µs

50µs

Intel X5560 @ 2.8GHz / 36GB

C++

AD Teaching Wiki: InformationRetrievalWS1314/ResultsListIntersection (last edited 2013-11-05 00:56:42 by Hannah Bast)