A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
| A. | insertion sort |
| B. | selection sort |
| C. | heap sort |
| D. | quick sort |
Answer : B Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
