D-有序顺序表归并

void Merge(SeqList &LA, SeqList &LB, SeqList &LC)
{
    int i, j, k;
    i = j = k = 0;
    while(i < LA.length && j < LB.length)
    {
      if(LA.data[i] < LB.data[j])
      {
          LC.data[k] = LA.data[i]; k ++; i ++;
      }
      else
      {
          LC.data[k] = LB.data[j]; k ++; j ++;
      }
    }
    while(i != LA.length)
    {
        LC.data[k] = LA.data[i]; k ++; i ++;
    }
    while(j != LB.length)
    {
        LC.data[k] = LB.data[j]; k ++; j ++;
    }
    LC.length = LA.length + LB.length;
}