An alternative visual analysis of the build heap algorithm

Authors:
Hussein Thompson;Pranay Chadhuri
Affiliations:
University of the West Indies, Bridgetown, Barbados;Heritage Institute of Technology, Kolkata 700 107 India
Venue:
ACM Inroads
Year:
2011

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
Teaching the analysis of algorithms with visual proofs

SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach
Data Structures and Algorithms

Data Structures and Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A visual proof for an average case of list searching

ACM SIGCSE Bulletin
A visual proof of amortised-linear resizable arrays

ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.