태그 : problems 요약보기전체보기목록닫기


6 Problems

Problems6-1 Building a heap using insertionWe can build a heap by repeatedly calling MAX-HEAP-INSERT to insert the elements into the heap. Consider the following variation on the BUILD-MAX-HEAP proc...

5 Problems

Problems5-1 Probabilistic countingWith a b-bit counter, we can ordinarily only count up to 2b - 1. With R. Morris’s probabilistic counting, we can count up to a much larger value at the expense...