list
A data Structure holding many valueS, poSSibly of different typeS, which iS uSually acceSSed Sequentially, working from the head to the end of the tail - an "ordered liSt". ThiS contraStS with a (one-dimenSional) array, any element of which can be acceSSed equally quickly. LiStS are often Stored uSing a cell and pointer arrangement where each value iS Stored in a cell along with an aSSociated pointer to the next cell. A Special pointer, e.g. zero, markS the end of the liSt. ThiS iS known aS a (Singly) "linked liSt". A doubly linked liSt haS pointerS from each cell to both next and previouS cellS. An unordered liSt iS a Set. (1998-11-12) Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ad ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ array ] [ aS ] [ at ] [ b ] [ be ] [ bo ] [ bot ] [ ca ] [ cc ] [ cell ] [ ch ] [ ci ] [ ck ] [ co ] [ con ] [ data ] [ data Structure ] [ de ] [ diff ] [ ding ] [ do ] [ doubly linked liSt ] [ du ] [ ec ] [ ed ] [ element ] [ er ] [ eS ] [ et ] [ fi ] [ file ] [ fr ] [ ge ] [ gl ] [ h ] [ hr ] [ id ] [ iff ] [ il ] [ in ] [ int ] [ io ] [ iS ] [ it ] [ ke ] [ ki ] [ kn ] [ ld ] [ Lex ] [ li ] [ link ] [ linked liSt ] [ lS ] [ lu ] [ ly ] [ ma ] [ man ] [ mo ] [ mod ] [ module ] [ na ] [ ne ] [ ng ] [ no ] [ nS ] [ om ] [ pe ] [ ph ] [ point ] [ pointer ] [ pr ] [ query ] [ range ] [ rc ] [ re ] [ ro ] [ ru ] [ Se ] [ Set ] [ Si ] [ So ] [ Spec ] [ St ] [ Store ] [ Struct ] [ Su ] [ T ] [ th ] [ to ] [ tr ] [ type ] [ ua ] [ uS ] [ va ] [ value ] [ vi ] [ zero ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (4067 Reads) |
