Practice Selection Sort (11.1) - Selection Sort - Design & Analysis of Algorithms

Practise this section

10 questions

Flashcard drill
3 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 Selection Sort?
Show hintHide hint
Think about how many times we compare elements.
Question 2.
Describe the first step of Selection Sort.
Show hintHide hint
What do we look for in the first pass?
3Question 3.
What is the primary method of operation of Selection Sort?
- A. Bubble and swap
- B. Select and place
- C. Insert in order
Show hintHide hint
Think about how the elements are organized in selection sort.
4Question 4.
True or False: Selection Sort is more efficient than Merge Sort for large datasets.
- True
- False
Show hintHide hint
How does the complexity of each algorithm stack up?
Question 5.
Given an unsorted array of integers with negative numbers, implement Selection Sort and explain each iteration.
Show hintHide hint
Pay close attention to negative numbers and their positions.
Question 6.
Analyze the performance of Selection Sort by applying it to an already sorted array. How many iterations were needed and why?
Show hintHide hint
Observe the swapping process carefully, even if no elements appear to change.

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