Messages in this thread | | | From | Matthijs Melchior <> | Subject | Re: Ordered Sorted List | Date | Sat, 26 Nov 2005 12:03:14 +0100 |
| |
Nanakos Chrysostomos wrote: > Hi ,all.Can someone please explain this source code with an example??? ..... > void slistInsert(slist *sp,int t) > { > ListNode *n=(ListNode *)malloc(sizeof(ListNode)); > if(n == NULL) > { > printf("Out of memory\n"); > exit(1); > } > n->data = t; > while(*sp!=NULL && (*sp)->data < t) > { > sp = &((*sp)->next); // Why we do this here,i miss this point
This is done to move to the next item in the list. The expression is complicated because 'sp' is a pointer to a pointer to a structure.
> } > n->next = *sp; > *sp = n; > > } > .....
-- Matthijs Melchior.
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |