source: Deliverables/D3.1/C-semantics/test/insertsort.c @ 485

struct list {
  unsigned char i;
  __pdata struct list *next;
};

__pdata struct list l6 = {69, 0};
__pdata struct list l5 = {36, &l6};
__pdata struct list l4 = {136, &l5};
__pdata struct list l3 = {105, &l4};
__pdata struct list l2 = {234, &l3};
__pdata struct list l1 = {240, &l2};
__pdata struct list l0 = {102, &l1};

void insert(__pdata struct list *element, __pdata struct list **dest) {
  if (*dest == 0 || (*dest)->i >= element->i) {
    element -> next = *dest;
    *dest = element;
  } else
    insert(element, &(*dest)->next);
}

void sort(__pdata struct list **list) {
  __pdata struct list *current;
  __pdata struct list *next = *list;
  __pdata struct list *result = 0;
  while (next) {
    current = next;
    next = next->next;
    insert (current, &result);
  }
  *list = result;
}

extern void out(unsigned char c);

int main(void) {
  __pdata struct list *l = &l0;

  sort(&l);
  while (l) {
    out(l->i);
    l = l->next;
  }

  return 0;
}