When we analyze the performance of the sorting algorithm, we interest primarily on the number of comparison and exchange.
Average Exchange
Let En be the total average number of exchange to sort array of N element. E1 = 0 (we do not need any exchange for array with one element). The average num...
