When is Insertion Sort a good choice for sorting an array?

The array contains only a few records
  • Each record requires a large amount of memory
  • Each record requires a small amount of memory
  • The processor speed is fast
  • The array contains many records
  • None of these situations

Insertion Sort if fairly simple.

Because Insertion Sort is simple, it tends to cost only a little bit per comparison when compared to more complicated sorting algorithms.