Differences between revisions 26 and 30 (spanning 4 versions)

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. Please give these two numbers with the same precision as in the rows already there, for example, 8.5 million, but not 8.48834 million. For comparison, I also implemented the two algorithms and put my two numbers. Can you beat them? I did not do anything particularly fancy, expect paying attention that the code in the inner loop is as simple as possible, as discussed in the lecture.

No.	Name	Solution (PDF)	Code (ZIP or TGZ)	elems / second simple alg	elems / second search alg	Progr. Language
0.	Hannah			252.1 million	213.4 million	C++
1.	Claudius Korzen	PDF	ZIP	9.6 million	1.6 million	Java
2	Mirko Brodesser	PDF	ZIP	21.0 million	12.8 million	Java
3	Ivo Malenica	PDF	tar	[not done]	[not done]
4	Thomas Liebetraut	PDF	tgz	0.5 million	0.1 million	Python
5	Eric Lacher	PDF(1/2) PDF(2/2)	ZIP	49.1 million	3.8 million	Java
6	Marius Greitschus	PDF	.tar.gz	71.2 million	2.3 million	C#
7	Zhongjie Cai	PDF	ZIP	19.0 million	8.0 million	VB.Net

-  ⇤ ← Revision 26 as of 2009-11-24 00:55:37 → 
  Size: 2778
  Editor: Hannah Bast
  Comment:
+   ← Revision 30 as of 2009-11-24 01:25:23 → ⇥
  Size: 3101
  Editor: Hannah Bast
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 7:
-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. '''Please give the number with the same precision as in the rows already there, for example, 8.5 million, but not 8.48834 million.'''
+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. '''Please give these two numbers with the same precision as in the rows already there, for example, 8.5 million, but not 8.48834 million.''' For comparison, I also implemented the two algorithms and put my two numbers. Can you beat them? I did not do anything particularly fancy, expect paying attention that the code in the inner loop is as simple as possible, as discussed in the lecture.
 Line 10:
+||0. || Hannah || || || 252.1 million || 213.4 million || C++ ||