Selection Sort Problems
Problem : Why is selection sort's efficiency independent of the data being sorted?
Problem : Consider the following list: (4, 3, 8, 22, 1, 5). What will this list look like after the first swap?
Problem : Imagine the following implementation of selection sort: instead of selecting the smallest element and putting it at the front, we instead select the largest element and put it at the end of the list. Does this change the algorithm's efficiency?
Problem : When would bubble sort be a better algorithm to use than selection sort?