The exchange sort compares each element of an array and swaps those elements that are not in their proper position. The only difference between an exchange sort algorithm and bubble sort is how they compare the elements. The exchange sort algorithm can be explained by assigning i(min)=i and increasing j=i+1 to n-1. Now if i(a(j)
