Can you explain how sleepsort is constant time when it requires looping through n items?
From a practical perspective, I do not believe it is bounded by K, where all numbers you sort are less than K. Consider an array of one hundred trillion items, each being the number 1. This is bounded by the array length, not the number 1.