以下排序算法的名称是
n = seq.length
for j=1 to n-1
smallest = j
for i = j+1 to n
if seq[i] < seq[smallest]
smallest = i
exchange seq[j] with seq[smallest]
for j=1 to n-1
smallest = j
for i = j+1 to n
if seq[i] < seq[smallest]
smallest = i
exchange seq[j] with seq[smallest]
