Wouldn't using a sparse bit-array be equivalent to using Bucketsort in space-complexity, but more efficient in time-complexity, or am I missing something here.