Size: 2017
Comment:
|
Size: 2015
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 12: | Line 12: |
||3 ||[[SearchEnginesWS0910/nibblerExercises|Ivo Malenica]] ||[[attachment:SearchEnginesWS0910/nibblerExercises/loesung05.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/nibblerExercises/src_abgabe2.tar|tar]] || TODO || TODO || || | ||3 ||[[SearchEnginesWS0910/nibblerExercises|Ivo Malenica]] ||[[attachment:SearchEnginesWS0910/nibblerExercises/loesung05.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/nibblerExercises/src_abgabe2.tar|tar]] || --- || --- || || |
Exercise Sheet 5
The rules for uploading are the same as always. If you forgot them, you can read them again here.
Your solutions (files can only be read by the uploader and by us)
Along with your files please also fill in the rate in elements per second of the two algorithms when intersecting two lists of size 10^6 = 1 million,
No. |
Name |
Solution (PDF) |
Code (ZIP or TGZ) |
elems / second simple alg |
elems / second search alg |
Progr. Language |
1. |
9.6 million |
1.6 million |
Java |
|||
2 |
21.0 million |
12.8 million |
Java |
|||
3 |
--- |
--- |
|
|||
4 |
TODO |
TODO |
Python |
|||
5 |
TODO |
TODO |
Java |