Scan the unsorted part for its smallest value and swap it to the front of that part. The sorted part grows from the left by one element per pass.
Scan the unsorted part for its smallest value and swap it to the front of that part. The sorted part grows from the left by one element per pass.