Much of the subsequent research on integer sorting algorithms has focused less on practicality and more on theoretical improvements in their worst case analysis, and the algorithms that come from this line of research are not believed to be practical for current 64-bit computer architectures, although experiments have shown that some of these methods may be an improvement on radix sorting for data with 128 or more bits per key.
Mnogo kasnije istraživanja o algoritmu celobrojnog sortiranja usmerena su više na praktičnost nego na teorijska poboljšanja u najgorem slučaju , i algoritmi koji dolaze iz ove pretrage nisu praktični na 64-bitnoj arhitekturi računara, takođe eksperimenti su pokazali da neke od ovih metoda mogu biti poboljšanja na radix sortiranju za podatke koji sadrže 128 ili više bita po ključu.