¿Esta es tu empresa?
Insert an element in a sorted circular linked list.
Anónimo
typedef struct _elem { int data; struct _elem *next; } elem; elem *insert(elem *e, elem *list) { elem *i; if (!list) { e->next = e; return e; } for (i = list; i->next != list && i->next->data data; i = i->next); e->next = i->next; i->next = e; if (i == list && e->data data) return e; else return list; }