#acl Claudius Korzen:read,write All:read

= Results for Exercise Sheet 3 (Intersecting Lists) =
Add your row to the table below, following the examples already there. In the 1st column, write your account name, or name1+name2 if you work in a group.
In the 2nd and 3rd column, write down the average runtime of the baseline algorithm and of your improved algorithm on your machine, in '''micro'''seconds as an integer.
As mentioned in the lecture, repeat each measurement '''5 times''' and take the average.
In the columns 4-6, write down the speedup ratios as floats with '''exactly two digits of precision''', measured as time_for_baseline / time_for_your_version (<1 = slower, >1 = faster).
In the columns 7+8, give details about your programming language and your machine specifications.
In the last column '''briefly''' describe the improvements you implemented.

|| |||| ''Average Runtime (in µs)'' |||||| ''Speedup ratio'' |||| || ||
||'''Name''' || '''Baseline''' || '''Your version''' || '''existence + bielefeld''' ||'''them + bielefeld'''||'''them + existence'''||'''Language'''||'''Machine Spec'''||'''Summary Improvements'''||
|| ck1028    || ?              || ?                  || 0.00                        || 0.00                 || 0.00                 || Java         || ?                || ?                          ||
|| ck1028    || ?              || ?                  || 0.00                        || 0.00                 || 0.00                 || C++          || ?                || ?                          ||

it's the average time of your best approach taken over all three pairs (five runs each).