Tools

Aim

Overview

Recap

Pretest

Selection Sort

Aim Concept Algorithm Demo Practice Exercise Quiz

Code Assessment

Analysis

Aim Overview Time and Space Complexity Demo Comparison with other Algorithms Quiz

Posttest

Selection Sort

1. Selection sort has the same average case time complexity as worst-case time complexity

a: True b: False

2. In which case selection sort can be used?

a: For a fast and efficient sorting b: For memory efficient sorting c: Sorting without comparisons d: None of the above

3. Pick the incorrect step in selection sorting

a: Find the smallest element with the least index, such that index≤i≤N-1. b: Swap the element at index i with the element at index i+1 c: Swap the smallest element found with the element at index i. d: None of the above

4. What are the correct intermediate steps when you perform Selection Sort on [2, 7, -3, 5]?

a: [-3, 2, 7, 5] -> [-3, 2, 5, 7] b: [-3, 7, 2, 5] -> [-3, 2, 7, 5] -> [-3, 2, 5, 7] c: [-3, 7, 5, 2] -> [-3, 2, 5, 7] d: [-3, 7, 2, 5] -> [-3, 5, 2, 7] -> [-3, 2, 5, 7]

How many loops will be there in the Selection sort code?

a: One Loop b: Two nested loops c: Two separate loops d: Three separate loops

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)