Current Slide
Speaker notes:
Content Tools
Sources
There are currently no sources for this slide.
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Binary tree in which each node’s value > the values of children
Takes 2J operations to construct, then each of K “winners” read off in 2log J steps.
For J=1M, K=100, this is about 10% of the cost of sorting.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License