|
Size: 1406
Comment:
|
Size: 1194
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 5: | Line 5: |
| 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. |
For each intersection result, write down (1) the runtime of the baseline algorithm, (2) the runtime of your improved algorithm (both in '''micro'''seconds as an integer) and (3) the speedup ratio as float with '''exactly two digits of precision''', measured as time_for_baseline / time_for_your_algorithm (<1 = slower, >1 = faster). |
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. For each intersection result, write down (1) the runtime of the baseline algorithm, (2) the runtime of your improved algorithm (both in microseconds as an integer) and (3) the speedup ratio as float with exactly two digits of precision, measured as time_for_baseline / time_for_your_algorithm (<1 = slower, >1 = faster). In the last column briefly describe the improvements you implemented.
|
X + Y |
Y + Z |
X + Z |
X + Y + Z |
|
||||||||||
Name |
Baseline |
Yours |
Ratio |
Baseline |
Yours |
Ratio |
Baseline |
Yours |
Ratio |
Baseline |
Yours |
Ratio |
Language |
Summary Improvements |
|
ck1028 |
? |
? |
0.00 |
? |
? |
0.00 |
? |
? |
0.00 |
? |
? |
0.00 |
Java |
? |
|
ck1028 |
? |
? |
0.00 |
? |
? |
0.00 |
? |
? |
0.00 |
? |
? |
0.00 |
C++ |
? |
|