Q. 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 (Solved)
1. insertion sort
2. selection sort
3. heap sort
4. quick sort
- b. selection sort