 In the bottom-up merge sort, the starting point assumes each run is one item long.In practice, random input data will have many short runs that just happen to be sorted.In the typical case, the natural merge sort may not need as many passes because there are fewer runs to merge.