Content deleted Content added
Undid revision 1081094688 by 95.74.37.32 (talk) |
No edit summary Tag: Reverted |
||
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
{
/* find the min element in the unsorted a[i .. aLength-1] */
| |||