Changeset 1844:eaa5f5b855f7 in lemon0.x for test/radix_sort_test.cc
 Timestamp:
 12/03/05 19:15:43 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2403
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

test/radix_sort_test.cc
r1833 r1844 16 16 17 17 void checkRadixSort() { 18 int n = 10000; 19 vector<int> data1(n), data2(n); 20 for (int i = 0; i < n; ++i) { 21 data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))  500; 22 } 23 radixSort(data1.begin(), data1.end()); 24 sort(data2.begin(), data2.end()); 25 for (int i = 0; i < n; ++i) { 26 check(data1[i] == data2[i], "Test failed"); 18 { 19 int n = 10000; 20 vector<int> data1(n), data2(n); 21 for (int i = 0; i < n; ++i) { 22 data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))  500; 23 } 24 radixSort(data1.begin(), data1.end()); 25 sort(data2.begin(), data2.end()); 26 for (int i = 0; i < n; ++i) { 27 check(data1[i] == data2[i], "Test failed"); 28 } 29 } { 30 int n = 10000; 31 vector<unsigned char> data1(n), data2(n); 32 for (int i = 0; i < n; ++i) { 33 data1[i] = data2[i] = (int)(200 * (rand() / (RAND_MAX + 1.0))); 34 } 35 radixSort(data1.begin(), data1.end()); 36 sort(data2.begin(), data2.end()); 37 for (int i = 0; i < n; ++i) { 38 check(data1[i] == data2[i], "Test failed"); 39 } 27 40 } 28 41 } … … 30 43 31 44 void checkCounterSort() { 32 int n = 10000; 33 vector<int> data1(n), data2(n); 34 for (int i = 0; i < n; ++i) { 35 data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))  500; 36 } 37 counterSort(data1.begin(), data1.end()); 38 sort(data2.begin(), data2.end()); 39 for (int i = 0; i < n; ++i) { 40 check(data1[i] == data2[i], "Test failed"); 45 { 46 int n = 10000; 47 vector<int> data1(n), data2(n); 48 for (int i = 0; i < n; ++i) { 49 data1[i] = data2[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0)))  500; 50 } 51 counterSort(data1.begin(), data1.end()); 52 sort(data2.begin(), data2.end()); 53 for (int i = 0; i < n; ++i) { 54 check(data1[i] == data2[i], "Test failed"); 55 } 56 } { 57 int n = 10000; 58 vector<unsigned char> data1(n), data2(n); 59 for (int i = 0; i < n; ++i) { 60 data1[i] = data2[i] = (int)(200 * (rand() / (RAND_MAX + 1.0))); 61 } 62 counterSort(data1.begin(), data1.end()); 63 sort(data2.begin(), data2.end()); 64 for (int i = 0; i < n; ++i) { 65 check(data1[i] == data2[i], "Test failed"); 66 } 41 67 } 42 68 }
Note: See TracChangeset
for help on using the changeset viewer.