The bubble sort algorithm shown in this chapter is less efficient than it can be. If a pass is made throught the list without
exchanging any elements, this means that the list is sorted and there is no reason to continue. Modify this alforithm so that it will stop as soon as it recognizes that the list is sorted. Do not use a break statement.