Selection sort: Difference between revisions

Revision as of 14:12, 21 May 2022

Revision as of 14:14, 21 May 2022

Line 86:

/* advance the position through the entire array */

/* (could do i < aLength-1 because single element is also min element) */

for (i = 0; i < aLength ,<b>-1<b>; i++)

{

/* find the min element in the unsorted a[i .. aLength-1] */