[prev] 55 [next]

Higher-order Functions (cont)

Side-note: Higher-order functions can be non-recursive, e.g. 

void traverseI(List L, void (*visit)(Link))
{
   Link curr;
   curr = L;
   while (curr != NULL) {
     (*visit)(curr);
     curr = curr->next;
   }
}