Question

Explain why the shaker sort is efficient for sorting lists that are already in close to the correct order.

Short answer

It will also have $O\left(n^2\right)$complexity when it comes to number of comparisons but the much important part is the number of swaps.

Step-by-step solution

Shaker Sort

Shekar sort works by moving each element one place at a time until its gets to the place its need to be. This has a result of needing as much swap operations as the sum of the displacements of each element from its place.

Explain

So, if the starting list is almost sorted the shaker sort will need just a few swaps to get all element in place. It will also have$O\left(n^2\right)$ complexity when it comes to number of comparisons but the much important part is the number of swaps.