Answer:
The given list is following:
[55, 68, 27, 13, 95, 77, 15, 43, 31, 46],
1st iteration:
[13,68,27,55,95,77,15,43,31,46]
2nd iteration:
[13,15,27,55,95,77,68,43,31,46]
3rd iteration:
[13,15,27,55,95,77,68,43,31,46] // if in your algorithm you have already make a condition to check if the next element is already is in the right place then this iteration will be skipped and another iteration after 6th iteration in this given answer will be counted as 6th.
4th iteration
[13,15,27,31,95,77,68,43,55,46]
5th iteration
[13,15,27,31,43,77,68,95,55,46]
6th iteration
[13,15,27,31,43,46,68,95,55,77]
Step-by-step explanation:
Selection sort is a algorithm which search the whole list and find the minimum value and swap it with the left most value in the list and this process is repeated until the list is sorted completely.
I hope it will help you!