#acl All:read,write
= 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. The number in parantheses after the query is the ratio between the two list length, rounded to the next integer.

2. Provide the query times in '''micro'''seconds (µ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.
||<style="text-align:center" |2>'''Name''' ||||<style="text-align:center">''university german (2:1)'' ||||<style="text-align:center">''university berlin (13:1)'' ||||<style="text-align:center">''university freiburg (198:1)'' ||<style="text-align:center" |2>'''Processor / RAM''' ||<style="text-align:center" |2>'''Language''' ||
||'''simple''' ||'''gallop''' ||'''simple''' ||'''gallop''' ||'''simple''' ||'''gallop''' ||
||Björn ||430µs ||530µs ||134µs ||146µs ||72µs ||21µs ||Intel X5560 @ 2.8GHz / 36GB ||C++ ||