Sequential Search (list)

NODE_PTR search(NODE_PTR p, int x){

while (p != NULL){

if (p->info == x) return p;

p = p->next;

}

return NULL;

}

Previous slide

Next slide

Back to first slide

View graphic version