well i have some kind of problem... the goal is to developt a algorithm to sort a linked list (single or double linked).. that uses the less memory possible.. we can use for exemple auxiliar lists with pointers to the real registers instead of the real lists.. thats an example..
so i dont know if i'll use single or double linked lists... neither the best algorithm..
sorry for the english xD
peace