From CLRS page 459 in Chapter 19.. (Its not clearly pasted here)
"the binary representation of n has
⌊lg n⌋ + 1 bits, say
< b⌊lg n⌋; b⌊lg n⌋−1;....... ; b0>
, so that n =
Σ⌊lg n⌋
i=0 bi2^i. By property 1 of Lemma 19.1,
therefore, binomial tree Bi appears in H if and only if bit bi = 1." Use this property to answer the
following questions about some specific binomial heaps.
How many binomial trees are used when forming a binomial heap with 743 elements?
How many comparisons are required to add a key to a binomial heap with 743 elements?
How many comparisons are required to merge a binomial heap with 1221 elements with
a binomial heap with 829 elements?
## Deliverables
[login to view URL] requirements notice: As originally posted, this bid request does not have complete details. Should a dispute arise and this project go into arbitration "as is", the contract's vagueness might cause it to be interpreted against you, even though you were acting in good-faith. So for your protection, if you are interested in this project, please work-out and document the requirements onsite.
Projekt-ID: 3166809
Über das Projekt
Remote Projekt
Aktiv vor 13 Jahren
Möchten Sie etwas Geld verdienen?
Vorteile einer Ausschreibung auf Freelancer
Legen Sie Ihr Budget und Ihren Zeitrahmen fest
Für Ihre Arbeit bezahlt werden
Skizzieren Sie Ihren Vorschlag
Sie können sich kostenlos anmelden und auf Aufträge bieten