SlideShare is now on Android. 15 million presentations at your fingertips.  Get the app

×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

Computer notes - Build Heap

by on Dec 28, 2011

  • 549 views

The general algorithm is to place the N keys in an array and consider it to be an unordered binary tree

The general algorithm is to place the N keys in an array and consider it to be an unordered binary tree

Statistics

Views

Total Views
549
Views on SlideShare
549
Embed Views
0

Actions

Likes
0
Downloads
23
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

Computer notes  - Build Heap Computer notes - Build Heap Presentation Transcript