Chapter 3.3, Problem 44E

To determine

(a)

Describe how the number of comparisons uses in the worst case changes when the size of the list to be sorted from $n\text{ to }2n$, where $n$ is a positive integer when there sorting algorithm are used for bubble short.

To determine

(b)

Describe how the number of comparisons uses in the worst case changes when the size of the list to be sorted from $n\text{ to }2n$, where $n$ is a positive integer when there sorting algorithm are used for insertion short.

To determine

(c)

Describe how the number of comparisons uses in the worst case changes when the size of the list to be sorted from $n\text{ to }2n$, where $n$ is a positive integer when there sorting algorithm are used for selection short.

To determine

(d)

Describe how the number of comparisons uses in the worst case changes when the size of the list to be sorted from $n\text{ to }2n$, where $n$ is a positive integer when there sorting algorithm are used for binary insertion short.