Description

8 questions. Q1: Array [3,1,4,1,5]. After pass 1 (selecting minimum), array is? → [1,3,4,1,5] (swap 3 and first 1). Q2: How many total comparisons for array of size 6? → 5+4+3+2+1 = 15. Q3: Selection sort on already-sorted array [1,2,3,4,5]. Time complexity? → Still O(n²) - always scans everything!

Details