Lecture 7 Notes Quicksort

Bubble Sort • Worst-case analysis: –The first pass makes n-1 swaps –The second pass makes n-2 swaps –… –The last pass makes 1 swap • The worst number of swaps: + + … + (n -1) = n(n-1)/2 ≈ n2/2 • It may be efficient for nearly-sorted vectors. • In general, bubble sort is … ................
................