# Question: hello would someone please help me with this question i...

###### Question details

Hello. Would someone please help me with this question? I need to figure out how to do the following:

**a) Give the worst-case running time of BubbleSort, in
big-O notation. Please give me all the steps so I can
understand.
b) Give the best-case running time of BubbleSort, in big-O
notation, with justification. Please give me all the steps, so I
can understand.**

*I'm confused how to calculate the total costs of the iterations, like the n values, etc. Where do you start so that you end up with BigO(n) or Big0(n*

^{2})? From my understanding, they are both (best/worst cases) - does that sound right? How do you arrive at that? Steps would be really helpful.Please use this pseudocode as reference for this problem.

Thank you so much!