Selection Sort & Exhaustive Search

What is the time complexity of the Selection Sort algorithm for sorting an array of N elements?

• a. O(N)

• b. O(N^2)

• c. O(log N)

• d. O(N^2 log N)

How does the Selection Sort algorithm work?

• a. It divides the array into subarrays for sorting.

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

• c. It uses a stack to sort the elements.

• d. It employs a binary search to find the smallest element.

Which of the following is true about Selection Sort?

• a. It is an unstable sorting algorithm.

• b. It is an adaptive sorting algorithm.

• c. It has a best-case time complexity of O(N log N).

• d. It is more efficient than Quick Sort.

In Selection Sort, how many comparisons are made to sort an array of N elements?

• a. N

• b. N-1

• c. N^2

• d. N/2

Which sorting algorithm is more efficient than Selection Sort on average?

• a. Quick Sort

• b. Merge Sort

• c. Bubble Sort

• d. Insertion Sort

In Selection Sort, how many swaps are made to sort an array of N elements?

• a. N

• b. N-1

• c. N^2

• d. N/2

Which of the following sorting algorithms is not an in-place sorting algorithm?

• a. Selection Sort

• b. Quick Sort

• c. Merge Sort

• d. Bubble Sort

What is an Exhaustive Search algorithm commonly used for?

• a. Sorting arrays.

• b. Solving optimization problems by checking all possible solutions.

• c. Finding the shortest path in a graph.

• d. Cryptography.

Which term is often used interchangeably with "Exhaustive Search"?

• a. Divide and Conquer

• b. Greedy Algorithm

• c. Brute Force

• d. Dynamic Programming

In an Exhaustive Search, what is the main drawback?

• a. It is the most efficient algorithm for all problems.

• b. It requires checking all possible solutions, which can be time-consuming.

• c. It guarantees the optimal solution for all problems.

• d. It only works for sorting problems.