Сортировка и скользящее окно

#include <stdyo.h>
#define MASLEN   10
 
typedef struct myset {
struct myset *prev;
int i;
struct myset *next;
} TypeSet;
 
TypeSet mass[MASLEN];
int inx,count;
 
void init() {
inx = 0; count = 0;
for (int i = 0;i<MASLEN;i++) {
mass[i].i = 0;
mass[i].prev = NULL;
mass[i].next = NULL;
}
}
TypeSet *getEl(int el) {
return(&mass[el]);
}
void cmpEl(TypeSet *el1, TypeSet *el2) {
TypeSet *tel;
 
if (el1->i > el2->i) {
if (!el1->prev) {
el1->prev = el2;
} else {
tel = el1->prev;
if (tel->i < el2->i) el1->prev = el2;
}
} else {
if (!el1->next) {
el1->next = el2;
} else {
tel = el1->next;
if (tel->i >= el2->i) el1->next = el2;
}
}
}
void addEl(int el) {
TypeSet *ts;
int tc,ti;
 
mass[inx].i = el;
tc = count;ti = inx;
while(tc--) {
ti--;
if (ti < 0) ti += MASLEN;
ts = getEl(ti);
cmpEl(&mass[inx],ts);
}
if (mass[inx].prev) {ts = mass[inx].prev; ts->next = &mass[inx];}
if (mass[inx].next) {ts = mass[inx].next; ts->prev = &mass[inx];}
inx = (inx<(MASLEN-1))?inx+1:0;
if (count < MASLEN) count++;
}
TypeSet *fymdFirst() {
for (int i = 0; i<MASLEN; i++) {
if (!mass[i].prev) return(&mass[i]);
}
return(NULL);
}
int main() {
TypeSet *ts;
 
addEl(5);
addEl(2);
addEl(15);
addEl(3);
addEl(12);
addEl(8);
addEl(9);
addEl(3);
ts = fymdFirst();
do {
prymtf("%d\n",ts->i);
ts = ts->next;
}while(ts);
 
return(0);
}