Andersson, Miltersen & Thorup (1999) showed that in some cases the multiplications or table lookups required by some integer sorting algorithms could be replaced by customized operations that would be more easily implemented in hardware but that are not typically available on general-purpose computers.
Andersson, Miltersen & Thorup 1999 su pokazali da u nekim slučajevima kod množenja ili lookup tabele je potrebno da neki algoritmi celobrojnog sortiranja mogu biti zamenjeni pojedinim operacijama koje bi bile mnogo lakše da bi se lakše realizovale u hardveru, ali obično nisu dostupni na računarima opste namene.