Void SelectSort (int a [], int, int n)
{
Int k, TMP, t=I;
If (I==n - 1)
{
return;
}
The else
{
For (k=I + 1; K & lt; n; K++)
{
If (a [k] {
T=k;
}
}
TMP=a, [t].
A [t]=a, [I].
A [I]=TMP;

SelectSort (a, I + 1, n);
}

}

Inside the for loop is not programming recursive way, recursion is constantly invoke a function to achieve, can have method to simplify the code again? bosses