exchange sort python
The exchange sort compares each element of an array and swap those elements that are not in their proper position,
just like a bubble sort does. The only difference between the two sorting algorithms is the manner in which they compare the elements.
The exchange sort compares the first element with each element of the array, making a swap where is necessary.
In some situations the exchange sort is slightly more efficient than its counter part the bubble sort. The bubble sort needs a final pass to determine that it is finished, thus is slightly less efficient than the exchange sort, because the exchange sort doesn’t need a final pass.