Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 3 - Exercises - Page 142: 12


In each iteration of the bubble sort, the bubble sort compares each element with the adjacent one, and thus filters the largest element in the unsorted part to the end of the unsorted array. Thus, in the first iteration, when the number of elements in the unsorted array is $(\mathrm{n}),$ bubble sort compares element $1$ to $2,2$ to $3,$ and so on to $(n-1)$ to $n,$ and thus does $n-1$ comparisons. Similarly, the second iterations do $(n-2)$ comparisons, and thus, the total number of comparisons is: $C=(n-1)+(n-2)+(n-3)+\ldots .+1=\frac{(n-1)(n)}{2}=\Theta\left(n^{2}\right)$

Work Step by Step

Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.