order.c
10.1 KB
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
/**********************************************************************/
/* */
/* FILENAME: order.c */
/* BY: Jonathan G. Fiscus */
/* NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY */
/* SPEECH RECOGNITION GROUP */
/* */
/* DESC: this file contains routines to sort and rank */
/* various types of numeric arrays in INCREASING */
/* of DECREASING order */
/* */
/**********************************************************************/
#include "sctk.h"
/**********************************************************************/
/* qsort short comparison functions */
int qsort_short_cmp(const void *p, const void *p1);
int qsort_short_deccmp(const void *p, const void *p1);
static short *short_cmp_arr;
int qsort_short_cmp(const void *p, const void *p1){
return(short_cmp_arr[*((int *)p)] - short_cmp_arr[*((int *)p1)]);
}
int qsort_short_deccmp(const void *p, const void *p1){
return(short_cmp_arr[*((int *)p1)] - short_cmp_arr[*((int *)p)]);
}
/**********************************************************************/
/* qsort int comparison functions */
int qsort_int_cmp(const void *p, const void *p1);
int qsort_int_deccmp(const void *p, const void *p1);
static int *int_cmp_arr;
int qsort_int_cmp(const void *p, const void *p1){
return(int_cmp_arr[*((int *)p)] - int_cmp_arr[*((int *)p1)]);
}
int qsort_int_deccmp(const void *p, const void *p1){
return(int_cmp_arr[*((int *)p1)] - int_cmp_arr[*((int *)p)]);
}
int qsort_int_compare(const void *i, const void *j) {
return(*((int *)i) - *((int *)j));
}
/**********************************************************************/
/* qsort double comparison functions */
int qsort_double_cmp(const void *p, const void *p1);
int qsort_double_deccmp(const void *p, const void *p1);
static double *double_cmp_arr;
int qsort_double_cmp(const void *p, const void *p1){
double f = double_cmp_arr[*((int *)p)] - double_cmp_arr[*((int *)p1)];
return((f < 0.0) ? -1 : ((f > 0) ? 1 : 0));
}
int qsort_double_deccmp(const void *p, const void *p1){
double f = double_cmp_arr[*((int *)p1)] - double_cmp_arr[*((int *)p)];
return((f < 0.0) ? -1 : ((f > 0) ? 1 : 0));
}
int qsort_double_compare(const void *i, const void *j) {
double f = *((double *)i) - *((double *)j);
return((f < 0.0) ? -1 : ((f > 0) ? 1 : 0));
}
/**********************************************************************/
/* Sort a short array */
/* arr -> the short array */
/* ptr_arr -> an integer array of indexes into arr. */
/* using this array to index arr, sorts the arr */
/**********************************************************************/
void sort_short_arr(short int *arr, int num, int *ptr_arr, int order)
{
int j;
/* init the indexes to 1-n */
for (j=0;j<num;j++)
ptr_arr[j] = j;
short_cmp_arr = arr;
if (order == INCREASING)
qsort((void *)ptr_arr,num,sizeof(int),qsort_short_cmp);
else
qsort((void *)ptr_arr,num,sizeof(int),qsort_short_deccmp);
}
/**********************************************************************/
/* Sort a double array */
/* arr -> the double array */
/* ptr_arr -> an integer array of indexes into arr. */
/* using this array to index arr, sorts the arr */
/**********************************************************************/
void sort_double_arr(double *arr, int num, int *ptr_arr, int order)
{
int j;
/* init the indexes to 1-n */
for (j=0;j<num;j++)
ptr_arr[j] = j;
double_cmp_arr = arr;
if (order == INCREASING)
qsort((void *)ptr_arr,num,sizeof(int),qsort_double_cmp);
else
qsort((void *)ptr_arr,num,sizeof(int),qsort_double_deccmp);
}
/**********************************************************************/
/* Sort a int array */
/* arr -> the int array */
/* ptr_arr -> an integer array of indexes into arr. */
/* using this array to index arr, sorts the arr */
/**********************************************************************/
void sort_int_arr(int *arr, int num, int *ptr_arr, int order)
{
int j;
/* init the indexes to 1-n */
for (j=0;j<num;j++)
ptr_arr[j] = j;
int_cmp_arr = arr;
if (order == INCREASING)
qsort((void *)ptr_arr,num,sizeof(int),qsort_int_cmp);
else
qsort((void *)ptr_arr,num,sizeof(int),qsort_int_deccmp);
}
/**********************************************************************/
/* Sort an array strings. to access the results, a double */
/* indirection is needed. */
/* arr -> the 2 dimarr of chars */
/**********************************************************************/
void sort_strings_using_index(char **arr, int *ind, int num, int order)
{
int i, j, tmp;
for (i=0;i<num;i++)
ind[i] = i;
if (order == DECREASING){
for (j=num;j>0;j--){
for (i=0;i<j-1;i++)
if (strcmp(arr[ind[i]],arr[ind[i+1]]) < 0){
tmp = ind[i];
ind[i] = ind[i+1];
ind[i+1] = tmp;
}
}
}
else{
for (j=num;j>0;j--)
for (i=0;i<j-1;i++)
if (strcmp(arr[ind[i]],arr[ind[i+1]]) > 0){
tmp = ind[i];
ind[i] = ind[i+1];
ind[i+1] = tmp;
}
}
/* printf("sort debug\n");
for (i=0;i<num;i++)
printf(" %d arr[%d]-> %s \n",i,ind[i],arr[ind[i]]);*/
}
/**********************************************************************/
/* Sort an array strings in place */
/* arr -> the 2 dimarr of chars */
/**********************************************************************/
void sort_strings_in_place(char **arr, int num, int order)
{
int i, j;
char *tmp;
if (order == DECREASING){
for (j=num;j>0;j--){
for (i=0;i<j-1;i++)
if (strcmp(arr[i],arr[i+1]) < 0){
tmp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = tmp;
}
}
}
else{
for (j=num;j>0;j--)
for (i=0;i<j-1;i++)
if (strcmp(arr[i],arr[i+1]) > 0){
tmp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = tmp;
}
}
/* for (i=0;i<num;i++)
printf("%s ",arr[i]);
printf("\n");*/
}
/**********************************************************************/
/* Sort and rank an integer array */
/* arr -> the integer array */
/* ptr_arr -> an integer array of indexes into arr. */
/* using this array to index arr, sorts the arr */
/* rank_arr -> an array of mean ranks of the elements in arr */
/**********************************************************************/
void rank_int_arr(int *arr, int num, int *ptr_arr, double *rank_arr, int order)
{
int i, j, tmp, count;
sort_int_arr(arr, num, ptr_arr, order);
/* mean rank the short arr */
/* . . . the average of the ranks for duplicate numbers */
for (j=0;j<num;j++){
/* if the next number is = the the current number */
if ((j<num-1) && (arr[ptr_arr[j]] == arr[ptr_arr[j+1]])){
/* find the last duplicate number */
count = j;
while((count < num-1) &&
(arr[ptr_arr[count]] == arr[ptr_arr[count+1]])){
count++;
}
/* count the number of duplicates */
tmp = 0;
for (i=j;i<count+1;i++)
tmp+=i;
/* install the averages in all duplicates */
for (i=j;i<count+1;i++)
rank_arr[ptr_arr[i]] = (double)tmp/(double)(count+1-j) + 1.0;
/* go the the end of the duplicates */
j=i-1;
}
else{
/* no duplicates, use the index as the rank */
rank_arr[ptr_arr[j]] = (double)(j+1);
}
}
}
/**********************************************************************/
/* Sort and rank an double array */
/* arr -> the double array */
/* ptr_arr -> an integer array of indexes into arr. */
/* using this array to index arr, sorts the arr */
/* rank_arr -> an array of mean ranks of the elements in arr */
/* */
/* *** for comments, look up at sort_int_arr */
/* */
/**********************************************************************/
void rank_double_arr(double *arr, int num, int *ptr_arr, double *rank_arr, int order)
{
int i, j, tmp, count;
sort_double_arr(arr, num, ptr_arr, order);
for (j=0;j<num;j++){
if ((j<num-1) && (arr[ptr_arr[j]] == arr[ptr_arr[j+1]])){
count = j;
while((count < num-1) &&
(arr[ptr_arr[count]] == arr[ptr_arr[count+1]])){
count++;
}
tmp = 0;
for (i=j;i<count+1;i++)
tmp+=i;
for (i=j;i<count+1;i++)
rank_arr[ptr_arr[i]] = (double)tmp/(double)(count+1-j) + 1.0;
j=i-1;
}
else{
rank_arr[ptr_arr[j]] = (double)(j+1);
}
}
}