C++编程之美-数字之魅(代码清单2-13)

if(X > h[0])
{
     h[0] = X;
     p = 0;
     while(p < K)
     {
          q = 2 * p + 1;
          if(q >= K) 
                break;
          if((q < K – 1) && (h[q + 1] < h[q]))
               q = q + 1;
          if(h[q] < h[p])
          {
               t = h[p]; 
               h[p] = h[q];
               h[q] = t;
               p = q;
          }
          else
               break;
     }
}