File:Binary heap bottomup vs topdown.svg
From Infogalactic: the planetary knowledge core

Size of this PNG preview of this SVG file: 800 × 289 pixels. Other resolution: 320 × 116 pixels.
Original file (SVG file, nominally 1,687 × 609 pixels, file size: 14 KB)
Summary
This picture shows the difference in time complexity between building a heap ('heapify') from the bottom up and form top down. The number in each circle shows the maximum times of swapping needed to add the respective node into the heap. By summing up the numbers on two sides, it will be obvious that building from bottom up have fewer times than from top down.
Licensing
Lua error in package.lua at line 80: module 'strict' not found.
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 06:26, 13 January 2017 | ![]() | 1,687 × 609 (14 KB) | 127.0.0.1 (talk) | This picture shows the difference in time complexity between building a heap ('heapify') from the bottom up and form top down. The number in each circle shows the maximum times of swapping needed to add the respective node into the heap. By summing up the numbers on two sides, it will be obvious that building from bottom up have fewer times than from top down. |
- You cannot overwrite this file.
File usage
The following page links to this file: