View difference between Paste ID: 404y6qBc and Tws8u2YT

     void radixSort(ArrayList<E> *lista, int base, int numMaxSize){
 
         lista->goToStart();
         LinkedList<E>  listBucket[base];
         for(int j = 0; j!=numMaxSize; j++)
         {
             while(lista->getSize()!=0)
             {
                 int  tmpNum = int(lista->getElement()) /  pow(base,j) ;
                 int tmpPos =  tmpNum % base;
                 listBucket[tmpPos].append(lista->remove());
             }
             for(int i = 0; i!=base; i++)
-                while(listBucket[i].getSize()!=0)
+            {
-                    lista->append(listBucket[i].remove());
+               while(listBucket[i].getSize()!=0)
-        }
+                {
-        cout << "hola radix" << endl;
+                   lista->append(listBucket[i].remove());
                 }
             }
         }
     }