Changeset 2242:16523135943d in lemon-0.x for benchmark/radix_sort-bench.cc
- Timestamp:
- 10/14/06 17:26:05 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2991
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
benchmark/radix_sort-bench.cc
r1956 r2242 27 27 #include <lemon/radix_sort.h> 28 28 29 #include <lemon/random.h> 30 29 31 #include <vector> 30 32 #include <algorithm> … … 38 40 vector<int> data(n); 39 41 for (int i = 0; i < n; ++i) { 40 data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))- 500;42 data[i] = rnd[1000] - 500; 41 43 } 42 44 radixSort(data.begin(), data.end()); … … 48 50 vector<int> data(n); 49 51 for (int i = 0; i < n; ++i) { 50 data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))- 500;52 data[i] = rnd[1000] - 500; 51 53 } 52 54 counterSort(data.begin(), data.end()); … … 57 59 vector<int> data(n); 58 60 for (int i = 0; i < n; ++i) { 59 data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))- 500;61 data[i] = rnd[1000] - 500; 60 62 } 61 63 sort(data.begin(), data.end()); … … 66 68 vector<int> data(n); 67 69 for (int i = 0; i < n; ++i) { 68 data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))- 500;70 data[i] = rnd[1000] - 500; 69 71 } 70 72 stable_sort(data.begin(), data.end());
Note: See TracChangeset
for help on using the changeset viewer.