Quick sorting by yourself

# Include <stdio. h>
# Include <malloc. h>
 
# Define Elem int
 
Typedef struct sqlist {
Elem key;
Int data;
} Sqlist;
 
Void quicksort (sqlist R [], int min, int max ){
Int I, j;
I = min;
J = max;
Sqlist temp;

If (min <max ){
Temp = R [I];
While (I! = J ){
While (I <j & temp. key <R [j]. key ){
J --;
}
If (I <j ){
R [I] = R [j];
} Www.2cto.com
While (I <j & temp. key> R [I]. key ){
I ++;
}
If (I <j ){
R [j] = R [I];
}
}
R [I] = temp;
Quicksort (R, min, I-1 );
Quicksort (R, I + 1, max );
}

}
 
 
Void main (){
Sqlist dataSort [10];
Int I = 0;
For (I = 0; I <10; I ++ ){
DataSort [I]. key = 10-I;
DataSort [I]. data = I;
}
Quicksort (dataSort, 0, 9 );
For (I = 0; I <10; I ++ ){
Printf ("key: % d data: % d \ n", dataSort [I]. key, dataSort [I]. data );
}

}
 
W397090770 Column