alright. i have a program that inputs a data into a linked list.
remove(list)
{
pointer->nextaddr=pointer->nextaddr->nextaddr;
}
this function removes the contents in a linked list.
i need something where i can input a new list into the already existing list and then sort it by comparing the lsit to each item in the linked list.
how can i do this? do i have to work backwards?
does it involve resetting a pointer to the list?
remove(list)
{
pointer->nextaddr=pointer->nextaddr->nextaddr;
}
this function removes the contents in a linked list.
i need something where i can input a new list into the already existing list and then sort it by comparing the lsit to each item in the linked list.
how can i do this? do i have to work backwards?
does it involve resetting a pointer to the list?