Algorithms solutions
Wednesday, June 3, 2015
Exercise 6.1-2
Show that an n-element heap has
Answer
We can use the maximum and minimum from exercise 6.1-1
For the lower bound we have:
For the upper bound we have:
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment