selection (int a[],int N)
{
int i, j, min, t;
for(i=1;i<n;i++){>
min=i;
for(j=i+1;j<=N;j++){
if(a[j]){
min = j;
t = a[min];
a[min] = a[i];
a[i] = t;
Also the following algorithm:
insertion(int a[], int N)
{
int i,j,v;
for(i=2;i<=N;i++){
v=a[i];j=i;
while(a[j-1]>v){
a[j] = a[j-1];
j--;
a[j]=v;
}
}
}
How to convert the two sorts above so they will work on a linked list?
John