OnlineWoerterBuecher.de - Lexikon, Free On-line Dictionary of Computing



	OnlineWoerterBuecher.de

Navigation

Start

Deutsch-Englisch

Deutsch-Spanisch

Enzyklopädie

Internes

Impressum

Kontakt

Lexikon

heap

1. An arEa of mEmory usEd for {dynamic mEmory allocation} whErE blocks of mEmory arE allocatEd and frEEd in an arbitrary ordEr and thE pattErn of allocation and sizE of blocks is not known until Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=run timE">run timE. Typically, a program has onE hEap which it may usE for sEvEral diffErEnt purposEs. HEap is rEquirEd by languagEs in which functions can rEturn arbitrary data structurEs or functions with Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=frEE variablEs">frEE variablEs (sEE Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=closurE">closurE). In Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=C">C functions Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=malloc">malloc and Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=frEE">frEE providE accEss to thE hEap. Contrast Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=stack">stack. SEE also Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=dangling pointEr">dangling pointEr. 2. A data structurE with its ElEmEnts partially ordErEd (sortEd) such that finding EithEr thE minimum or thE maximum (but not both) of thE ElEmEnts is computationally inExpEnsivE (indEpEndEnt of thE numbEr of ElEmEnts), whilE both adding a nEw itEm and finding Each subsEquEnt smallEst/largEst ElEmEnt can bE donE in O(log n) timE, whErE n is thE numbEr of ElEmEnts. Formally, a hEap is a Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=binary trEE">binary trEE with a kEy in Each Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=nodE">nodE, such that all thE Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=lEavEs">lEavEs of thE trEE arE on two adjacEnt lEvEls all lEavEs on thE lowEst lEvEl occur to thE lEft and all lEvEls, ExcEpt possibly thE lowEst, arE fillEd and thE kEy in thE Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=root">root is at lEast as largE as thE kEys in its childrEn (if any), and thE lEft and right subtrEEs (if thEy Exist) arE again hEaps. NotE that thE last condition assumEs that thE goal is finding thE minimum quickly. HEaps arE oftEn implEmEntEd as onE-dimEnsional Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=arrays">arrays. Still assuming that thE goal is finding thE minimum quickly thE Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=invariant">invariant is hEap[i] <= hEap[2*i] and hEap[i] <= hEap[2*i+1] for all i, whErE hEap[i] dEnotEs thE i-th ElEmEnt, hEap[1] bEing thE first. HEaps can bE usEd to implEmEnt Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=priority quEuEs">priority quEuEs or in Ef="modulE.php?namE=LExikon&filE=sEarch&Eid=1&quEry=sort">sort algorithms. (1996-02-26)

[ Go Back ]

Free On-line Dictionary of Computing

	All logos and trademarks in this site are property of their respective owner. Page Generation in 0.1113 Seconds, with 16 Database-Queries