d/freebsd-skq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix the way in which median is calculated. If the data source has even

Browse Source 
number of data points, value should be calculated by adding two middle
elements and dividing them by 2.

Approved by:	cognet (mentor)
This commit is contained in:
wkoszek 2006-02-23 20:46:10 +00:00
parent cacaead301
commit c5c882e144
2 changed files with 36 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
tools/tools/ministat/ministat.c
View File

@ -202,15 +202,26 @@ Avg(struct dataset *ds)
static double
Median(struct dataset *ds)
{
int i;
struct point *pp;
int even, i;
struct point *p1, *p2;
i = ds->n / 2;
TAILQ_FOREACH(pp, &ds->list, list) {
if (i--)
continue;
return (pp->val);
if ((ds->n % 2) == 1) {
i = (ds->n / 2) + 1;
even = 0;
} else {
i = ds->n / 2;
even = 1;
}
TAILQ_FOREACH(p1, &ds->list, list) {
--i;
if (i == 0)
break;
}
if (even) {
p2 = TAILQ_NEXT(p1, list);
return ((p2->val + p1->val) / 2);
}
return (p1->val);
}
static double

25
usr.bin/ministat/ministat.c
View File

@ -202,15 +202,26 @@ Avg(struct dataset *ds)
static double
Median(struct dataset *ds)
{
int i;
struct point *pp;
int even, i;
struct point *p1, *p2;
i = ds->n / 2;
TAILQ_FOREACH(pp, &ds->list, list) {
if (i--)
continue;
return (pp->val);
if ((ds->n % 2) == 1) {
i = (ds->n / 2) + 1;
even = 0;
} else {
i = ds->n / 2;
even = 1;
}
TAILQ_FOREACH(p1, &ds->list, list) {
--i;
if (i == 0)
break;
}
if (even) {
p2 = TAILQ_NEXT(p1, list);
return ((p2->val + p1->val) / 2);
}
return (p1->val);
}
static double