insertion sort
void Insertion(int *A, int n){
int i, j, key;
for(i=n; i; i++) {
key = A[i];
j = i-1;
while (j>=0 && key
A[j+1] = A[j];
j--;
}
A[j+1] = key;
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here