Question

Explain insertion sort with an example.​

Answer 1

Answer:

Insertion sort is a simple sorting algorithm that works similar to the way you sort playing cards in your hands. The array is virtually split into a sorted and an unsorted part.

Pls Mark Brainiest