Why does the bubble sort algorithm does O(n2) comparisons on a list of size n?

I am studying for a test coming up and this was on the review guide, I can't seem to figure it out myself. Any help would be greatly appreciated.