Algorithm Node *evenOut(struct node *H, struct node *H1)
Input: A list of numbers
Output: A list pointed by H1 that only contains odd numbers
 
node *current = H;
node *oddCurrent = H1;
 node *startPointerForOdd = NULL;
 
node *temp1 = current;
node *temp2 = oddCurrent;
 
node *next;
 
int valueOfNode;
 
if (current == NULL)
{
      Return 0;
}
else
{
    while(current != NULL)
    { 
            valueOfNode = temp1->next->value;
            if(valueOfNode % 2 != 0)
            {
                      if(startPointerForOdd == NULL)
                      {
                                 temp2 = valueOfNode; 
                                 startPointerForOdd = temp2;
                      }
                      else
                     {
                                 temp 2 = startPointerForOdd;
                                  while(temp2 ->next != NULL)
                                  {
                                       temp2 = temp2->next;
                                   }
                                   temp2->next->value = valueOfNode;
                     }
             }           
    } 
}

while(current != NULL) {
    valueOfNode = current -> value;
    // do something with valueOfNode 
 
    current = current -> next;  // advance
}

 
current = H;       //current points to the first node of H.
oddStart = H1;   // oddStart points to the first node of H1.
node* newnode; // for a newnode.
while (current != NULL)
{
   nodeValue = current->value;
   if ( nodeValue % 2 != 0)
   {
      if (oddStart == NULL)
      {
         oddStart = new node;
         oddStart->value = nodeValue;
         oddStart->link = NULL;
      }
      else
      {
         temp = oddStart;
         while (temp->link != NULL)      // here 'link' is the link to the next node.
             temp = temp->link;
         newnode = new node;
         newnode->value = nodeValue;
         temp-> link = newnode;
         newnode->link = NULL;
      }
   }

 current = current->link;