I'd greatly appreciate it if someone could explain for me exactly how the selection sort algorithm works.
The relationship betweenCode:for (startScan = 0; startScan < (elems - 1); startScan++) { minIndex = startScan; minValue = array[startScan]; for (int index = startScan + 1; index < elems; index++) { if (array[index] < minValue) { minValue = array[index]; minIndex = index; } } array[minIndex] = array[startScan]; array[startScan] = minValue; }
andCode:minIndex = startScan; minValue = array[startScan];
is especially confusing me.Code:array[minIndex] = array[startScan]; array[startScan] = minValue;