Algorithm Selection Sort Quiz Quiestions

1. Which one of the following is the first step in a selection sort algorithm?

The minimum value in the list is found

The maximum value in the list is found

Adjacent elements are swapped

In a selection sort algorithm, the first step is to find the minimum value in the list. This is done by comparing each element with the current minimum value and updating the minimum if a smaller value is found. Once the minimum value is found, it is swapped with the first element in the list. This process is then repeated for the remaining elements in the list, finding the minimum value in each iteration and swapping it with the corresponding element. This continues until the list is fully sorted.

Explanation

In a selection sort algorithm, the first step is to find the minimum value in the list. This is done by comparing each element with the current minimum value and updating the minimum if a smaller value is found. Once the minimum value is found, it is swapped with the first element in the list. This process is then repeated for the remaining elements in the list, finding the minimum value in each iteration and swapping it with the corresponding element. This continues until the list is fully sorted.

2. What are the correct intermediate steps of the following data set when it is being sorted with the Selection sort?
15,20,10,18

10, 20,15,18 -- 10,15,20,18 -- 10,15,18,20

15,20,10,18 -- 15,10,20,18 -- 10,15,20,18 -- 10,15,18,20

15,18,10,20 -- 10,18,15,20 -- 10,15,18,20 -- 10,15,18,20

15,10,20,18 -- 15,10,18,20 -- 10,15,18,20

The given data set is being sorted using the Selection sort algorithm. In each step of the algorithm, the smallest element from the unsorted portion of the list is selected and swapped with the element at the beginning of the unsorted portion.

In the first step, the smallest element, 10, is selected and swapped with the first element, resulting in the list: 10, 20, 15, 18.

In the second step, the smallest element from the remaining unsorted portion, 15, is selected and swapped with the second element, resulting in the list: 10, 15, 20, 18.

In the third and final step, the smallest element from the remaining unsorted portion, 18, is selected and swapped with the third element, resulting in the final sorted list: 10, 15, 18, 20.

Explanation

The given data set is being sorted using the Selection sort algorithm. In each step of the algorithm, the smallest element from the unsorted portion of the list is selected and swapped with the element at the beginning of the unsorted portion.

In the first step, the smallest element, 10, is selected and swapped with the first element, resulting in the list: 10, 20, 15, 18.

In the second step, the smallest element from the remaining unsorted portion, 15, is selected and swapped with the second element, resulting in the list: 10, 15, 20, 18.

In the third and final step, the smallest element from the remaining unsorted portion, 18, is selected and swapped with the third element, resulting in the final sorted list: 10, 15, 18, 20.

3. How many passes/scans will go through a list of 10 elements?

11

9

20

25

Since there are 10 elements in the list, each pass/scan will go through one element. Therefore, there will be a total of 10 passes/scans. However, the question is asking for the number of passes/scans, not the number of elements. Therefore, the correct answer is 9, as the first pass/scan is not counted.

Explanation

Since there are 10 elements in the list, each pass/scan will go through one element. Therefore, there will be a total of 10 passes/scans. However, the question is asking for the number of passes/scans, not the number of elements. Therefore, the correct answer is 9, as the first pass/scan is not counted.

4. In a selection sort structure, there is/are?

Two separate for loops

Three for loops, all separate

Two for loops, one nested in the other

A for loop nested inside a while loop

In a selection sort structure, there are two for loops, one nested in the other. This structure is used to sort a list of elements by repeatedly finding the minimum element from the unsorted part and placing it at the beginning. The outer loop iterates through each element of the list, while the inner loop compares the current element with the remaining elements to find the minimum. By nesting the inner loop within the outer loop, the algorithm can compare each element with all the remaining elements, ensuring that the minimum element is correctly placed.

Explanation

In a selection sort structure, there are two for loops, one nested in the other. This structure is used to sort a list of elements by repeatedly finding the minimum element from the unsorted part and placing it at the beginning. The outer loop iterates through each element of the list, while the inner loop compares the current element with the remaining elements to find the minimum. By nesting the inner loop within the outer loop, the algorithm can compare each element with all the remaining elements, ensuring that the minimum element is correctly placed.

5. How many passes (or "scans") will there be through a list being sorted using a selection sort?

Array_size*2

Array_size+1

Array_size-1

None of the above

In a selection sort, each pass involves finding the minimum element from the unsorted part of the list and swapping it with the first element of the unsorted part. After each pass, the sorted part of the list increases by one element. Since there are a total of array_size elements in the list, it will take array_size-1 passes to sort the entire list.

Explanation

In a selection sort, each pass involves finding the minimum element from the unsorted part of the list and swapping it with the first element of the unsorted part. After each pass, the sorted part of the list increases by one element. Since there are a total of array_size elements in the list, it will take array_size-1 passes to sort the entire list.