diff -r 37e0966e43b6 -r 16523135943d benchmark/radix_sort-bench.cc
--- a/benchmark/radix_sort-bench.cc	Fri Oct 13 15:10:50 2006 +0000
+++ b/benchmark/radix_sort-bench.cc	Sat Oct 14 15:26:05 2006 +0000
@@ -26,6 +26,8 @@
 
 #include <lemon/radix_sort.h>
 
+#include <lemon/random.h>
+
 #include <vector>
 #include <algorithm>
 #include <cmath>
@@ -37,7 +39,7 @@
   int n = 10000000;
   vector<int> data(n);
   for (int i = 0; i < n; ++i) {
-    data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500;
+    data[i] = rnd[1000] - 500;
   }
   radixSort(data.begin(), data.end());
 }
@@ -47,7 +49,7 @@
   int n = 10000000;
   vector<int> data(n);
   for (int i = 0; i < n; ++i) {
-    data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500;
+    data[i] = rnd[1000] - 500;
   }
   counterSort(data.begin(), data.end());
 }
@@ -56,7 +58,7 @@
   int n = 10000000;
   vector<int> data(n);
   for (int i = 0; i < n; ++i) {
-    data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500;
+    data[i] = rnd[1000] - 500;
   }
   sort(data.begin(), data.end());
 }
@@ -65,7 +67,7 @@
   int n = 10000000;
   vector<int> data(n);
   for (int i = 0; i < n; ++i) {
-    data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500;
+    data[i] = rnd[1000] - 500;
   }
   stable_sort(data.begin(), data.end());
 }