算法导论笔记（二）

A(low,mid,high)
leftsum=-∞
sum=0
for(i=mid; i>low; i--)
{
  sum=sum+A[i]
  if(sum>leftsum)
  {
    leftsum=sum
    maxleft=i
  }	
} 
rightsum=-∞
sum=0
for(j=mid+1; j<high; j++)
{
  sum=sum+A[j]
  if(sum>rightsum)
  {
    rightsum=sum
    maxright=j
  } 
}

Min-HEAPIFY(A,i)
l=LEFT(i)
r=RIGHT(i)
if(l<=A.heapsize && A[l]<A[i])
{
  smallest=l
}else
{
  smallest=i
}
if(r<=A.heapsize && A[r]<A[smallest])
{
  smallest=r
}
if(smallest!=i)
{
  exchange A[i] with A[smallest]
  Min-HEAPIFY(A,smallest)
}