Unit 3 Computing 013

Which of the following best describes the selection sort algorithm?

• It repeatedly selects the largest element and moves it to the end.

• It repeatedly selects the smallest element and moves it to the beginning.

• It repeatedly selects the smallest element and swaps it with the first unsorted element.

• It repeatedly selects the largest element and swaps it with the last unsorted element.

In the quick sort algorithm, what is the purpose of the pivot element?

• To divide the array into two equal halves.

• To find the maximum element in the array.

• To partition the array into elements less than and greater than the pivot.

• To sort the array in descending order.

Which of the following is a disadvantage of the selection sort algorithm?

• It requires additional memory for sorting.

• It is not stable.

• It is not an in-place sorting algorithm.

• It has a high average-case time complexity.

In quick sort, which of the following strategies can be used to choose a pivot?

• Always choose the first element.

• Always choose the last element.

• Choose a random element.

• All of the above.

Which of the following is true about the quick sort algorithm?

• It is a stable sorting algorithm.

• It is an in-place sorting algorithm.

• It always requires additional memory.

• It is slower than selection sort in all cases.

What is the main advantage of quick sort over selection sort?

• Quick sort is easier to implement.

• Quick sort has a better average-case time complexity.

• Quick sort is more stable.

• Quick sort uses less memory.

Which of the following scenarios can lead to the worst-case time complexity for quick sort?

• When the pivot is always the median.

• When the pivot is always the smallest or largest element.

• When the array is already sorted.

• When the array has all identical elements.