数据结构考研分类复习真题 第十章 答案[4]

O(n)

O(nlogn)

()*i ()r[j]key>r[j+]key ()true ()r[j] ()*i

()*i ()j<=r ()j←j+ ()xkey>heap[j]key ()i←j ()j←*i ()x

()j:=*i ()finished:=false ()(r[j]key>r[j+]key) ()r[i]:=r[j] ()i:=j() j:=*i ()r[i]:=t; ()sift(rin) ()r[]:=r[i] ()sift(ri)

④是堆 ()选择 ()筛选法 ()O(nlogn) ()O()

() 选择 ()完全二叉树 ()O(NlogN) ()O() ()满足堆的性质

()finish:=false ()h[i]:=h[j]; i:=j; j:=*j; ()h[i]:=x ()hkn ()sift(hr)

{DQFXAPBNMYCW}

()p[k]:=j ()i:=i+ ()k= ()m:=n ()m<n ()a[i]:=a[m] ()a[m]:=t

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []