![Below is the algorithm of Selection sort:<br>for (index = 0; index < length - 1; index++)<br>1. Find the location, smallestIndex, of the smallest element in<br>list[index]...list[length - 1].<br>2. Swap the smallest element with list[index]. That is, swap<br>list[smallestIndex] with list[index].<br>}<br>Sort the following list using Selection sort. Show the list after<br>the fifth iteration of the outer loop: 26, 45, 17, 65, 33, 55, 12, 18<br>12, 17, 18, 26, 33, 55, 45, 65<br>• 12, 17, 18, 26, 33, 45, 65, 55<br>• 26, 45, 17, 65, 33, 55, 12, 18<br>• 17, 26, 45, 65, 33, 55, 12, 18<br>• 12, 17, 18, 26, 33, 55, 65, 45<br>• 12, 17, 18, 65, 33, 55, 26, 45<br>• 17, 26, 33, 45, 65, 55, 12, 18<br>](https://s3.us-east-1.amazonaws.com/storage.unifolks.com/qimg-008/008_yqgnyz0-l1pymdg4.png)
Extracted text: Below is the algorithm of Selection sort: for (index = 0; index < length="" -="" 1;="" index++)="" 1.="" find="" the="" location,="" smallestindex,="" of="" the="" smallest="" element="" in="" list[index]...list[length="" -="" 1].="" 2.="" swap="" the="" smallest="" element="" with="" list[index].="" that="" is,="" swap="" list[smallestindex]="" with="" list[index].="" }="" sort="" the="" following="" list="" using="" selection="" sort.="" show="" the="" list="" after="" the="" fifth="" iteration="" of="" the="" outer="" loop:="" 26,="" 45,="" 17,="" 65,="" 33,="" 55,="" 12,="" 18="" 12,="" 17,="" 18,="" 26,="" 33,="" 55,="" 45,="" 65="" •="" 12,="" 17,="" 18,="" 26,="" 33,="" 45,="" 65,="" 55="" •="" 26,="" 45,="" 17,="" 65,="" 33,="" 55,="" 12,="" 18="" •="" 17,="" 26,="" 45,="" 65,="" 33,="" 55,="" 12,="" 18="" •="" 12,="" 17,="" 18,="" 26,="" 33,="" 55,="" 65,="" 45="" •="" 12,="" 17,="" 18,="" 65,="" 33,="" 55,="" 26,="" 45="" •="" 17,="" 26,="" 33,="" 45,="" 65,="" 55,="" 12,="">