排序算法-插入排序/冒泡排序

1.插入排序

void InsertSort(int *A, int n)
{
// A is a int point point to a int Array and n is the length of the Array
  for(int j = 1; j < n; j++)
  {
    int key = A[j];
    int i = j - 1;
    while(key < A[i] && i >=0 )
    {
      A[i+1] = A[i];
      i = i-1;
    }   
    A[i+1] = key;
  }
 return ;
}

 2.冒泡排序

void BubbleSort(int *A, int n)
{
  for(int i = 0; i < n; i++)
  {
    for(int j = i; j < n; j++)
    {
      if(A[i] > A[j])
      {
         int temp = A[i];
         A[i] = A[j];
         A[j] = temp;
      }
    }
  }
  return ;
}