{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:59Z","timestamp":1763468099670,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T00:00:00Z","timestamp":1314748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Inroads"],"published-print":{"date-parts":[[2011,8,31]]},"abstract":"<jats:p>This article presents an alternative visual analysis of the BUILDHEAP algorithm provided by Goodrich and Tamassia [4]. The analysis is based only on elementary properties of complete binary trees and a simple comparison of the areas of rectangles. As such, it should be accessible to a wide cross-section of students taking a typical algorithm design and analysis course.<\/jats:p>","DOI":"10.1145\/2003616.2003630","type":"journal-article","created":{"date-parts":[[2012,10,15]],"date-time":"2012-10-15T19:22:23Z","timestamp":1350328943000},"page":"31-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An alternative visual analysis of the build heap algorithm"],"prefix":"10.1145","volume":"2","author":[{"given":"Hussein","family":"Thompson","sequence":"first","affiliation":[{"name":"University of the West Indies, Bridgetown, Barbados"}]},{"given":"Pranay","family":"Chadhuri","sequence":"additional","affiliation":[{"name":"Heritage Institute of Technology, Kolkata 700 107 India"}]}],"member":"320","published-online":{"date-parts":[[2011,8,31]]},"reference":[{"volume-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"Alfred V.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562877.1562979"},{"volume-title":"Introduction to Algorithms","year":"1990","author":"Thomas T.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/274790.274298"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Hammack R. H.\n     and \n      Lyons D. W. Alternating series convergence: A visual proof Teaching Mathematics and its \n  Applications 25 2 (\n  2006\n  ) 58--60 DOI=10.1093\/teamat\/hri005.  Hammack R. H. and Lyons D. W. Alternating series convergence: A visual proof Teaching Mathematics and its Applications 25 2 (2006) 58--60 DOI=10.1093\/teamat\/hri005.","DOI":"10.1093\/teamat\/hri005"},{"volume-title":"Introduction to Algorithms: A Creative Approach","year":"1989","author":"Udi Manber","key":"e_1_2_1_6_1"},{"volume-title":"Data Structures and Algorithms with Object-Oriented Design Patterns in C++","year":"1999","author":"Bruno Preiss","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1383602.1383639"}],"container-title":["ACM Inroads"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003616.2003630","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2003616.2003630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:32Z","timestamp":1750240472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003616.2003630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,31]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,8,31]]}},"alternative-id":["10.1145\/2003616.2003630"],"URL":"https:\/\/doi.org\/10.1145\/2003616.2003630","relation":{},"ISSN":["2153-2184","2153-2192"],"issn-type":[{"type":"print","value":"2153-2184"},{"type":"electronic","value":"2153-2192"}],"subject":[],"published":{"date-parts":[[2011,8,31]]},"assertion":[{"value":"2011-08-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}