while statement

[oneaz]

I'm confused with this one particular while statement. Can someone explain when will the loop be terminated and if possible, some example?

found = false;
while (current != NULL && !found)

and also, I'm confused which statement is included in the while loop. Here is the full code.

void list::insert(const int& newItem)
{
     nodeType *current;
     nodeType *trailCurrent;
     nodeType *newNode;
     bool found;
     newNode = new nodeType;
     newNode->info = newItem;
     newNode->link = NULL;

     if (first == NULL)  
     {
         first = newNode;
         last = newNode;
         count++;
     }
     else 
     {
         current = first;
         found = false;

        


	 while (current != NULL && !found) 
            if (current->info >= newItem)
                found = true;
            else
            {
                trailCurrent = current; 
                current = current->link; 
            }




         if (current == first)
         {
             newNode->link = first;
             first = newNode;
             count++;
         }
         else
         {
             trailCurrent->link = newNode;
             newNode->link = current;

             if (current == NULL)
                 last = newNode;

             count++;
         }
     }
}

[vlad from moscow]

There can be said nothing. The loop as can be terminated and can be not terminated. You did not show the compound statement of the loop.

[oneaz]

I edited the OP. Thanks

[vlad from moscow]

Here is the loop

	 while (current != NULL && !found) 
            if (current->info >= newItem)
                found = true;
            else
            {
                trailCurrent = current; 
                current = current->link; 
            }

It will be terminated either when there will be a node with field info that has a value greater than or equal to newItem or when there will not be such a node.

[oneaz]

Oh ok, I get it now. Thanks for the help!