File:Binary heap bottomup vs topdown.svg
From Vigyanwiki
Size of this PNG preview of this SVG file: 800 × 289 pixels. Other resolutions: 320 × 116 pixels | 640 × 231 pixels | 1,024 × 370 pixels | 1,280 × 462 pixels | 2,560 × 924 pixels | 1,687 × 609 pixels.
Original file (SVG file, nominally 1,687 × 609 pixels, file size: 14 KB)
Summary
| Description |
English: 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. 中文（臺灣）：此圖顯示出建造堆疊時，"從下往上建造"與"從上往下"之間時間複雜度的差別。圓圈上的每個數字表示加入該節點時，最多需要交換節點的次數。只要把兩邊的次數分別加總，就會很明顯地由下而上建造堆疊會比較省時間（交換節點的次數較少）。 |
| Date | |
| Source | Own work |
| Author | Explorer09 |
| SVG genesis |
Licensing
I, the copyright holder of this work, hereby publish it under the following licence:
 
|
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighbouring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 15:23, 14 January 2013 | | 1,687 × 609 (14 KB) | wikimediacommons>Explorer09 | Make the note caption smaller |
File usage
The following page uses this file:
