Quiz 9

The best method to select a pivot in quick sort is selecting the first element as pivot.

False

Radix sort operates in O(n+w) time, where w is the number of digits.

False

Merge sort can be used both as an internal and an external sort

True

Quick sort requires more space than Radix sort.

False

The worst case computing time of quick sort is O(n*logn).

False

Which of the following array is created after the first iteration of Radix sort, when the array contains {67,22,44,79,25,81,56,38}?

{81,22,44,25,56,67,38,79}

Since Radix Sort depends on digits or letters, Radix Sort is much less flexible than other sorts.

True

The worst case computing time of merge sort is O(n*logn).

True

Which of the following array is the result of the split operation, when the array contains {20,22,14,19,25,12} and 20 is selected as pivot in quick sort?

{19,12,14,20,25,22}

Which of the following array is created after the first iteration of binary merge sort, when the array contains {17,22,14,19,25,12,9,7}?

{17,22,14,19,12,25,7,9}