Data Structures Questions:

For what size arrays is Shellsort good for?

What is the Knuth sequence formula?

How does the partition algorithm work?

What is the efficiency (Big O Notation) of partition algorithm?

How does the quicksort algorithm work? Can it be used for small arrays?

What is the efficiency (Big O Notation) of quicksort algorithm?

The quicksort pivot value should be the key value of an actual data item; this item is called the pivot. True or False?

Because the quicksort pivots key value is used to partition the array, following the partition the left subarray holds items smaller than the pivot, and the right subarray holds items larger. True or False?

Ideally, the pivot should be the median of the items being sorted. That is, half the items should be larger than the pivot, and half smaller. True or False?

The worst situation for quicksort results when a subarray with N elements is divided into one subarray with 1 element and the other with N-1 elements. True or False?

The insertion sort can be efficiently used to sort subarrays smaller than a certain size during quicksort. True or False?