For the bubble sort with N items to sort, show that the number of iterations required to complete the sort is given by the following attached (you can do this by showing a couple of example N values and extrapolating from there): (N-1 (sum notation) k=1) k = ((N-1) * N) / 2

For, example, if N = 10, the number of iterations would be 9*10/2 = 45. The sigma notation, represents a sum over k. That is, for the expression in the sum (k in this case), you do a running sum for this expression over the integer values of k from 1 to N-1. I.e., 1+2++(N-1).