blob: 394405261906cefbd1d61343cb1da5c21e24db47 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
// Build don't link:
#include <stdio.h>
#include <stdlib.h>
#define MAX 256
#define MAXSTATE 1000000
struct R {
int count;
int state1;
int state2;
};
int cmp_d(const R* a, const R* b) {
return a->count > b->count;
}
namespace CXX {
template<class T, int i1, int i2>
inline void qsort (T b[i1][i2], int (*cmp)(const T*, const T*)) {
::qsort ((void*)b, i1*i2, sizeof(T), (int (*)(const void *, const void *))cmp);
}
}
using namespace CXX;
void sort_machine() {
struct R d[MAX][MAX];
qsort<R,MAX> (d, cmp_d);
}
|