PDS - 04225 - Sorting Algorithms - Chapter 11 - Part 2

Which algorithm matches this description: "a sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly selects the proper next value to move from the unsorted part to the end of the sorted part."

• Selection Sort

• Insertion Sort

• Radix Sort

• Merge Sort

Which algorithm matches this description: "a sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly inserts the next value from the unsorted part into the correct location in the sorted part."

• Selection Sort

• Insertion Sort

• Merge Sort

• Radix Sort

Which algorithm matches this description: "a sorting algorithm that treats the input as a collection of interleaved lists, and sorts each list individually with a variant of the insertion sort algorithm."

• Selection Sort

• Insertion Sort

• Merge Sort

• Shell Sort

Assume shell sort and a list of 6 elements, with a gap value of 3, how many interleaved lists will be sorted?

• 1

• 2

• 3

• 6

Assume shell sort and a list of 6 elements, with a gap value of 3, how many items will be in each interleaved list?

• 1

• 2

• 3

• 6

Assume shell sort and a list of 6 elements, If a gap value of 2 is chosen, how many interleaved lists will be sorted?

• 1

• 2

• 3

• 6

Which algorithm matches this description: "a sorting algorithm that repeatedly partitions the input into low and high parts (each part unsorted), and then recursively sorts each of those parts."

• Selection Sort

• Insertion Sort

• Shell Sort

• Quicksort

Which algorithm matches this description: "a sorting algorithm that divides a list into two halves, recursively sorts each half, and then merges the sorted halves to produce a sorted list."

• Selection Sort

• Insertion Sort

• Merge Sort

• Radix Sort

Which algorithm matches this description: "a sorting algorithm designed specifically for integers. The algorithm makes use of a concept called buckets and is a type of bucket sort. Any array of integer values can be subdivided into buckets by using the integer values' digits. A bucket is a collection of integer values that all share a particular digit value."

• Insertion Sort

• Selection Sort

• Merge Sort

• Radix Sort

Assume Radix sort and integers X and Y, such that X < Y. X will always be in a lower bucket than Y.

• True

• False