(Bubble sort complexity Question)
Here is the problem: http://f.imgtmp.com/APYz8.jpg .
For part (a), I'm really unsure as to how I should proceed.
As for (b), I need help in figuring out how the primitive operation estimations are conducted.
As for (c), I would think it is O(n^2) since the nested for loops would run n*n = n^2 times if the inner for loop did not have a -i in the "to n - 1 - i" part. So, I'm guessing it's something like O( n^2*log(n) ) but I'm just making an educated guess and have not taken any real objective steps.
Any help would be GREATLY appreciated!
Thanks

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

i would say two

Looking for something else?

Not the answer you are looking for? Search for more explanations.