Code:
void HoanVi(int &a, int &b)
{
int temp = a;
a = b;
b = temp;
}
void InsertionSort(int A[], int n)
{
for(int i = 0; i<n-1; i++)
{
for(int j = i+1; j>0; j--)
if(A[j] > A[j-1])
HoanVi(A[j],A[j-1]);
}
}
Code:
void HoanVi(int &a, int &b)
{
int temp = a;
a = b;
b = temp;
}
void InsertionSort(int A[], int n)
{
for(int i = 0; i<n-1; i++)
{
for(int j = i+1; j>0; j--)
if(A[j] > A[j-1])
HoanVi(A[j],A[j-1]);
}
}
|
|