Practice In-place Selection Sort (11.1.4) - Selection Sort - Design & Analysis of Algorithms - Vol 1

Practice: In-Place Selection Sort

Lesson 11.1.4Selection Sort

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 time complexity of the selection sort algorithm?
Show hintHide hint
Think about how many times we have to scan through the list.
Question 2.
In an unsorted array, which element do we look for first with selection sort?
Show hintHide hint
Consider what we mean by sorting into order.
3Question 3.
What is the first step in the selection sort algorithm?
- Swap the last two elements
- Find the smallest element
- Sort the entire array
Show hintHide hint
Recall the initial action when you start sorting.
4Question 4.
Selection sort is considered best suited for?
- Large datasets
- Small datasets
- Any datasets
Show hintHide hint
Think about where the algorithm might perform well.
Question 5.
Write a function that implements selection sort in a programming language of your choice. Explain the steps involved in the code clearly.
Show hintHide hint
Remember to check boundaries when accessing array indices.
Question 6.
Given an array of integers, find out how many swaps are performed by a selection sort on it. Write code to illustrate this.
Show hintHide hint
Consider implications of finding minimums and when actual swaps occur.

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