Insertion Sort is a _______ sorting algorithm that builds the final sorted array one _______ at a time.

  • Comparison, element
  • Divide and conquer, subset
  • Incremental, element
  • Simple, pass
Insertion Sort is an incremental sorting algorithm that builds the final sorted array one element at a time. It iterates through the array, comparing and inserting elements in their correct positions.
Add your answer
Loading...

Leave a comment

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