Computer Science, asked by gadekardhiraj80054, 3 months ago

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 azharsiddiqui063
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

Previous Question
Next Question
Similar questions
Sociology, 1 month ago
शहरी समुदाय- व्यक्तिवादाचा प्रभाव​...
Math, 1 month ago
can a polyhedron habe 20 faces , 30 edges and 12 vertices ? prove by eular formula ​...
English, 1 month ago
Read the following questions and write answers in together as a single paragraph. Suggest a suitable title to your writing. 1. Do you like to listen music/ songs?​
Math, 3 months ago
Length of the diagonals of a rhombus are 18 cm and 22 cm. Find its area​...
Math, 3 months ago
2. A grain wholesaler earns a profit of R12 per bag of wheat sold and a loss of T8 per bag of rice sold. ) If he sells 1500 bags of wheat and 2050 bags of rice in a month, what is his profit or loss? (ii) What is the number of wheat bags he must sell to have neither profit nor loss, if the number of rice bags sold is 2400 bags?​
Hindi, 10 months ago
please answer in hindi​...
Math, 10 months ago
Four rational number between 2/3 and 4/5.
English, 10 months ago
403) complete the web: Teachers innature​...