Settings Today

Faster than radix sort: Kirkpatrick-Reisch sorting

Radix sort sorts n w-bit integers by splitting them up into chunks of log?n\log nlogn bits each, and sorting each chunk in linear time. Thus it achieves O(nw/log?n)O(nw/\log n)O(nw/logn) time.

Published 1790 days ago

Go Back to Reading NewsBack Read News Collect this News Article

Login to Continue, We will bring you back to this content 0



For peering opportunity Autonomouse System Number: AS401345 Custom Software Development at ErnesTech Email Address[email protected]