 Since keys are not compared against each other, sorting time is O("cn"), where "c" depends on the size of the key and number of buckets.This is similar to a radix sort that works "top down," or "most significant digit first.