deba@1833: #define NDEBUG deba@1833: deba@1833: #include deba@1833: #include deba@1833: #include deba@1833: #include deba@1833: #include deba@1833: deba@1833: #include deba@1833: deba@1833: #include deba@1833: #include deba@1833: #include deba@1833: deba@1833: using namespace std; deba@1833: using namespace lemon; deba@1833: deba@1833: void testRadixSort() { deba@1833: int n = 10000000; deba@1833: vector data(n); deba@1833: for (int i = 0; i < n; ++i) { deba@1833: data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500; deba@1833: } deba@1833: radixSort(data.begin(), data.end()); deba@1833: } deba@1833: deba@1833: deba@1833: void testCounterSort() { deba@1833: int n = 10000000; deba@1833: vector data(n); deba@1833: for (int i = 0; i < n; ++i) { deba@1833: data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500; deba@1833: } deba@1833: counterSort(data.begin(), data.end()); deba@1833: } deba@1833: deba@1833: void testSort() { deba@1833: int n = 10000000; deba@1833: vector data(n); deba@1833: for (int i = 0; i < n; ++i) { deba@1833: data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500; deba@1833: } deba@1833: sort(data.begin(), data.end()); deba@1833: } deba@1833: deba@1833: void testStableSort() { deba@1833: int n = 10000000; deba@1833: vector data(n); deba@1833: for (int i = 0; i < n; ++i) { deba@1833: data[i] = (int)(1000 * (rand() / (RAND_MAX + 1.0))) - 500; deba@1833: } deba@1833: stable_sort(data.begin(), data.end()); deba@1833: } deba@1833: deba@1833: void testSorts() { deba@1833: { deba@1833: int n = 10000000; deba@1833: vector data(n); deba@1833: } deba@1833: cout << "Radix sort: " << runningTimeTest(testRadixSort, 60) << endl; deba@1833: cout << "Counter sort: " << runningTimeTest(testCounterSort, 60) << endl; deba@1833: cout << "Standard sort: " << runningTimeTest(testSort, 60) << endl; deba@1833: cout << "Stable sort: " << runningTimeTest(testStableSort, 60) << endl; deba@1833: } deba@1833: deba@1833: deba@1833: int main() { deba@1833: testSorts(); deba@1833: return 0; deba@1833: }