Exam 11: Sorting

It is known that Shell sort is O(n²) if successive powers of __________ are used for the gap value.

If the array bubble sort is applied to a sorted array, the number of exchanges is O(__________).

A shift in an insertion sort requires the movement of only one item, whereas in a bubble sort or a selection sort an exchange involves a temporary item and requires the movement of __________ items.

Whenever a recursive function is called, a copy of the local variables is saved on the run-time __________.

A variation on insertion sort, known as Shell sort, has O(__________) or better performance.