 Bubble sort can also be used efficiently on a list of any length that is nearly sorted (that is, the elements are not significantly out of place).For example, if any number of elements are out of place by only one position (e.g.0123546789 and 1032547698), bubble sort's exchange will get them in order on the first pass, the second pass will find all elements in order, so the sort will take only 2"n" time.