What are the advantages of using Insertion Sort over other sorting algorithms?

  • Requires additional memory
  • Stable, adaptive, and efficient for small datasets
  • Suitable only for numeric data
  • Unstable and has a high time complexity
Insertion Sort has advantages such as stability, adaptability, and efficiency for small datasets. It maintains the relative order of equal elements, adapts well to partially sorted data, and performs efficiently for small-sized arrays.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *