Solve

Question 12 (1 point) Listen Both the insertion sort and the selection sort algorithms have efficiencies on the order of where n is the number of values in the array being sorted. On On * logn the insertion sort has an efficiency of n and the selection sort has an efficiency of n^2 Question 13 (1 point) Listen Polymorphism is achieved by O overloading O overriding O embedding O abstraction O encapsulation Question 14 (1 point) Listen Although insertion sort and selection sort have generally the same performance, the selection sort has an advantage over the insertion sort. What is this advantage? O The selection sort usually makes fewer comparisons. O The selection sort usually makes fewer swaps. O The selection sort usually makes fewer passes. The selection sort usually makes fewer selections. None of these Question 15 (1 point) ) Listen What kind of performance can you expect if you perform a linear search on a sorted array? The performance will be about the same as on an unsorted array. O The performance will be much better than on an unsorted array. O The performance will be much worse than on an unsorted array. O The performance will be worse by about n"2 in this case None of these