In a radix sort, the radix is the number of elements to be sorted. A. True B. False

Which data structures are used by a radix sort? A. stacks B. A., B., and C. are all correct C. both A. and B. are correct D. heaps E. queues

The basic operation in sorting problem is

Which of the following is not in place sorting algorithm by default?

The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position. A. True B. False

In which  sort algorithm divides the list into two parts, sorted and unsorted. Initially, the sorted part contains only one element. In each pass, one element from the unsorted list is inserted at its correct position in the sorted list. As a result, the sorted list grows by one element and the unsorted list shrinks by one element in each pass.