radix sort using doubly linked list

[Simply Tom]

I am working on a program that sorts numbers using a radix sort and I think I am running into an infinite loop in one of these blocks. Anyone spot what is wrong?

 

void radix_sort(DLList& list){  DLList lstRay[10];  int ct = count(list);  int zeros = 0;  int tmp = 0;  int head = 0;   for(;ct >= 0; ct--)    {      while(!list.isEmpty()) {   head = list.deleteHead();   tmp = head / pow(10, zeros);   tmp = tmp % 10;   lstRay[tmp].addToTail(head); }      for(int x = 0; x <=9; x++){ list.append(lstRay[x]);}      zeros++;       }  } int count(DLList& list){  int ct = 0;  int ct2 = 0;  int tmp = 0;    while(!list.isEmpty())    {      ct = ct2;      tmp = list.deleteHead();      while(tmp >= 0){ tmp = tmp/10; ct2++;}      if(ct2 < ct){ ct2 = ct;       }    }  return ct2;}

Edited April 9, 2014 by alpenwasser
added code tags

[Ciccioo]

can you use the code tag please? a good indentation helps understanding the code too

 

anyway you should put some printf here and there to see where the execution gets stuck

 

anyway, i'd say that this looks like an infinite loop

while(tmp >= 0){              tmp = tmp/10;              ct2++;}

[WanderingFool]

@Ciccioo is right....mainly the >= is getting you into trouble, 1/10 = 0   so tmp > 0 should work.

 

I could be wrong, but couldn't you just replace that entire loop with an if statement log10?

if(tmp > 0)    cnt2 += 1+(int)log10(tmp); //Truncates, so 1 to 9 = 1, 10 to 99 = 2, 100 to 999 = 3, etc...