This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
haas:spring2014:data:projects:sll [2014/02/06 08:19] – wedge | haas:spring2014:data:projects:sll [2014/02/20 16:49] (current) – wedge | ||
---|---|---|---|
Line 52: | Line 52: | ||
* Node *mknode(int value); - allocate a new node, initialize to passed value, return a pointer to it | * Node *mknode(int value); - allocate a new node, initialize to passed value, return a pointer to it | ||
* Node *cpnode(Node *given); - allocate a new node, and duplicate its contents to match that of given node; return pointer to new node | * Node *cpnode(Node *given); - allocate a new node, and duplicate its contents to match that of given node; return pointer to new node | ||
- | * Node *rmnode(Node *start); - deallocate node, set to NULL, return updated pointer | + | * Node *rmnode(Node *given); - deallocate node, set to NULL, return updated pointer |
* void display(Node *start); - passing a list, display the nodes in the list (note that this function performs I/O in the form of output) | * void display(Node *start); - passing a list, display the nodes in the list (note that this function performs I/O in the form of output) | ||
- | * Node *sort(Node *start); - passing the appropriate values, sort the list from least to greatest. | ||
* Node *seeker(int pos); - pass the node number you'd like to seek to (remember in a singly linked list you may want it to be behind by one. | * Node *seeker(int pos); - pass the node number you'd like to seek to (remember in a singly linked list you may want it to be behind by one. | ||
* Node *mklist(); - create new linked list, returning a pointer to its start (use existing functions as part of implementation). This function will perform I/O to obtain information from the user | * Node *mklist(); - create new linked list, returning a pointer to its start (use existing functions as part of implementation). This function will perform I/O to obtain information from the user | ||
* Node *cplist(Node *start); - duplicate (allocate and copy) a list, return a pointer to start of new list | * Node *cplist(Node *start); - duplicate (allocate and copy) a list, return a pointer to start of new list | ||
* Node *rmlist(Node *start); - deallocate each node in the list | * Node *rmlist(Node *start); - deallocate each node in the list | ||
+ | * Node *sortlist(Node *start); - passing the appropriate values, sort the list from least to greatest. | ||
* int listQty(Node *start); - return a count of the number of nodes in a list | * int listQty(Node *start); - return a count of the number of nodes in a list | ||
+ | * Node *searchlist(Node *start, int value); - search from start of indicated list for value, returning pointer to first matching node (or NULL if not found). | ||
+ | * int getpos(Node *start, Node *given); - locate the position of given node from the start (0 position) of a list, return the numeric position |