1 votes 1 votes What simple change to the bucket sort preserves its linear average-case running time and makes its worst-case running time O(nlgn)? Algorithms algorithms sorting + – vaishali jhalani asked Nov 7, 2016 vaishali jhalani 338 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.