The order of the input records has what impact on the number of comparisons required by Insertion Sort (as presented in this module)?

There is a big difference, the asymptotic running time can change
  • None
  • There is a constant factor difference

Does Insertion Sort change when it make a comparison according to the order of the array input values?

Yes, Insertion Sort might stop early or might look at many records.