Thread: Sorting a linked list.

Trying to sort a linked list. I have two classes.
class listNode {
public:
int coef;
int expo;
listNode *next;
};


class LList {
private:
listNode *head;
listNode *tail;
public:
void read()
void sort();

};

I read in the two numbers coef and expo. I need to sort it in accending order by expo. My sort function is
void LList::sort() {

listNode *temp;
listNode *temp2;

temp = head;
temp2 = temp->next;
int CC = 0;
// counter is global and is size of list
while(CC != counter) {

if(temp->expo <= temp2->expo) {
head = temp2;
head->next = temp;
}

CC++;
}

}

It goes into an infinite loop then crashes.
Anyone offer advice on the problem? Thanks

I think the problem lies here:

Code:

while(CC != counter) {

   if(temp->expo <= temp2->expo) {
      head = temp2;               //temp2 never changes
      head->next = temp;      //temp never changes
   }
   CC++;
}

hk_mp5kpdw I did that with list. But when I go to print it out I get the same list printed. Here is my method

void LList:rint() {
listNode *temp;
temp = head;

while(temp != NULL) {
std::cout << temp->coef << " " << temp->expo << " ";
temp = temp->next;
} // end while

cout << endl << endl;
} // end function

I am thinking this has something to do with head and tail in the LList class not being changed. Offer anymore advice on how to do this? Thanks again.