How can I sort an array of small integers in less than O(nlogn) knowing that all the integers can fit in only one bite and I have infinite memory to use?
