Upper tail analysis of bucket sort and random tries

•We show that BucketSort runs in linear time with very high probability when the keys are chosen independently and uniformly at random from an interval.•The exponent in the probability depends on which subroutine is used to sort the elements in each bucket.