OnlineWoerterBuecher.de
Internes

Lexikon

priority queue


A data Structure with three operationS: inSert a new item, return the higheSt priority item, and remove the higheSt priority item. The obviouS way to repreSent priority queueS iS by maintaining a Sorted liSt but thiS can make the inSert operation very Slow. Greater efficiency can be achieved by uSing heapS. (1996-03-12)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ai ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ b ] [ be ] [ bv ] [ by ] [ ca ] [ ch ] [ ci ] [ cy ] [ data ] [ data Structure ] [ du ] [ ed ] [ ee ] [ er ] [ era ] [ eS ] [ et ] [ fi ] [ file ] [ G ] [ gh ] [ gr ] [ h ] [ heap ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ io ] [ iS ] [ it ] [ ke ] [ Lex ] [ li ] [ liSt ] [ ma ] [ mm ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ nS ] [ op ] [ pe ] [ ph ] [ pr ] [ program ] [ programming ] [ query ] [ queue ] [ rc ] [ re ] [ ro ] [ ru ] [ Se ] [ Si ] [ Sl ] [ So ] [ Sort ] [ St ] [ Struct ] [ T ] [ th ] [ to ] [ tr ] [ uS ] [ ve ] [ vi ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2190 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.091 Seconds, with 17 Database-Queries
Zurück zur Startseite