Practice Illustration Of Selection Sort (11.1.3) - Selection Sort - Design & Analysis of Algorithms

Practise this section

10 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the first step in selection sort?
Show hintHide hint
Think about how selection sort identifies which element to place first.
Question 2.
Explain what is meant by 'in-place sorting'.
Show hintHide hint
Consider how the elements are rearranged during sorting.
3Question 3.
What is the first action taken by the selection sort algorithm?
- Find the largest element
- Find the smallest element
- Sort the array
- None of the above
Show hintHide hint
Think about what selection sort establishes as the first step.
4Question 4.
Selection sort is considered an in-place algorithm.
- True
- False
Show hintHide hint
Recall the definition of in-place algorithms.
Question 5.
Demonstrate how selection sort behaves on an array with all elements the same, e.g., [3, 3, 3, 3]. What will the process look like?
Show hintHide hint
Think about what happens when the minimum element is always equal to the current element.
Question 6.
Modify the selection sort algorithm to sort in descending order. What changes are required?
Show hintHide hint
Consider how the definitions of 'smallest' and 'largest' affect the approach.

6 more questions in this section. Enroll free to practise them all.