From: alelvb@inwind.it   
      
   Il 11/03/2013 17:38, alexo ha scritto:   
      
   > // inserts value in a sorted way   
   >   
   > void Linked_List::insert_sorted(int value)   
   > {   
   >     Node * temp = head->next;   
   >     Node * after_me = head;   
   >   
   >   
   >     if(temp == 0) // if the list is empty   
   >     {   
   >         insert_after(value, head);   
   >         print_list();   
   >     }   
   >     else   
   >     {   
   >             while( (temp->next != 0) && (temp->getValue() < value ) )   
   >             {   
   >                 after_me = temp;   
   >                 temp = temp->next;   
   >             }   
   >             insert_after(value, after_me);   
   > //            print_list(); // for debugging only   
   >     }   
   > }   
      
   I've got it finally!   
   I've changed in the while loop of insert_sorted(int):   
      
   temp != 0   
      
   instead of   
      
   temp->next != 0   
      
      
   --   
         [ See http://www.gotw.ca/resources/clcm.htm for info about ]   
         [ comp.lang.c++.moderated.    First time posters: Do this! ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)