1. Say you have a list of numbers where only two numbers are out of place (they need to be swapped).  If you ran selection sort on this data, would it run any faster than on a list of random numbers?

2. If you knew that only two numbers were our of place, could you come up with a faster algorithm for sorting this data than selection sort?  What would be the running time of your algorithm?