1. What will be the number of passes to sort the elements using insertion sort?
14. 12. 16. 6. 3. 10
b) 5
ej 7
Answers
Answered by
0
Answer:
How many passes does an insertion sort algorithm consist of? Explanation: An insertion algorithm consists of N-1 passes when an array of N elements is given.
MAKE ME BRAINLIST
Similar questions