Algorithm-Sort-Direct Selection and sorting (Straight Selection Sort)

 

Void SelectSort (SeqList R)
{
Int I, j, k;
For (I = 1; I <n; I ++)
{
// Perform the I-th sorting (1 ≤ I ≤ N-1)
K = I;
For (j = I + 1; j <= n; j ++) // select the smallest key in the current unordered zone R [I. n]

Record R [k]
{
If (R [j]. key <R [k]. key)
{
K = j; // k. Write down the location of the currently found minimum keyword.
}
}
If (k! = I)
{
// Exchange R [I] and R [k]
R [temp] = R [I];
R [I] = R [k];
R [k] = R [temp]; // R [temp] as a temporary storage unit
} // Endif
} // Endfor
} // SeleetSort

Void SelectSort (int [] x)
{
For (int I = 0; I <x. Length-1; I ++)
{
// Just perform n-1 cycles
Int min = I;
For (int j = I + 1; j <x. Length; j ++)
{
If (x [j] <x [min])
{
Min = j;
}
}
If (min! = I)
{
// Exchange x [I] and x [k]
Int temp;
Temp = x [I];
X [I] = x [min];
X [min] = temp;
} // Endif
} // Endfor
} // SelectSort