C

$+$

$+$

$$Questions

The general purpose recursive sorting algorithm is

Select one:

a

$.$

$$Shell Sort

b

$.$

Radix Sort

c

$.$

Merge Sort

d

$.$

Heap Sort

e

$.$

Quick Sort

This advanced sorting algorithm is unique in that it requires only linear access to the data.

Select one:

a

$.$

Merge Sort

b

$.$

Shell Sort

c

$.$

Quick Sort

d

$.$

Radix Sort

e

$.$

Heap Sort

This sorting algorithm is unusual in that it does not actually compare the items in the list to be sorted.

Select one:

a

$.$

Radix Sort

b

$.$

Heap Sort

c

$.$

Shell Sort

d

$.$

Merge Sort

e

$.$

Quick Sort

This sorting algorithm takes advantage of a data structure that allows constant

$-$

time access to the largest element in the list.

Select one:

a

$.$

Radix Sort

b

$.$

Quick Sort

c

$.$

Shell Sort

d

$.$

Merge Sort

e

$.$

Heap Sort

This sorting algorithm, an improvement on exchange sort, is named for its inventor.

Select one:

a

$.$

Radix Sort

b

$.$

Heap Sort

c

$.$

Quick Sort

d

$.$

Shell Sort

e

$.$

Merge Sort