Answer
The best-case scenario would be with a sorted list as input. This means that only one pass will have to be performed before the algorithm "realizes" the list is sorted. For $n$ elements this means $n-1$ comparisons and no exchanges.
Work Step by Step
--
