Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

  • Congratulations Chriss Miller on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!

quick question

Status
Not open for further replies.

Goku

Programmer
Joined
Feb 2, 2001
Messages
3
Location
US
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?

 
Status
Not open for further replies.

Part and Inventory Search

Sponsor

Back
Top