Nvm got it thanks

This post was edited by lopelurag on Feb 11 2014 10:10pm

For this algorithm,

Worst case would be the array is reverse sorted, meaning you would have to do N*N comparisons.

Average case would be the array is partially sorted, but the algorithm isn't checking mid sort if the sort is complete. Thus, you still will do the full N*N comparisons.

Both running times would have O(N^2) running time

Yea I figured it out, needed the exact number of comparisons though, knew the Big-O was n^2

Got the summations figured out tho thanks