After the final sort has been completed the computer must check again to confirm that it is sorted correctly even if the list is already corrected, the computer doesn't know that. It can sort any group of numbers from lowest to highest. Every time the biggest number goes to the end on the first swap. On the second the second biggest numbers always goes second and then third and so on although they can already be in the place to start with. It is just certain that they will be in that place by that swap. A bubble sort has to have at least one swap even if it is completed already to check if it is completed or not. So for instance if the list is 6,5,7,8,9,10 it would take 2 swaps as one extra would be needed to check. The longest it can be is if the order is from highest to lowest and not lowest to highest.
