Search results

...h>\mathcal{V}</math>. An object of an implementation of this abstract data structure is repesented by: # This abstract data structure may be viewed as a specific, quite restricted type of [[Sets and sequences#

[[Category:Abstract Data Structure]] # The abstract data structure '''sorted sequence''' implements sorted sequences as defined [[Sets and seq

[[Category:Abstract Data Structure]] # The abstract data structure '''ordered sequence''' implements sorted sequences as defined [[Sets and se

...e types is deferred until the algorithm is called or an object of the data structure is created.

[[Category:Abstract Data Structure]] # The abstract data structure '''priority queue''' implements [[Sets and sequences#Ordered and sorted seq

[[Category:Data Structures]] ''' Abstract data structure:'''

'''Abstract data structure:''' [[Index handler]]

[[Category:Abstract Data Structure]] # This abstract data structure is [[Genericity|generic]] and parameterized by a fixed '''key type''' <math

[[Category:Abstract Data Structure]]

[[Category:Data Structure]] '''Abstract data structure:''' [[Sorted sequence]]

[[Category:Data Structures]] '''Abstract data structure:''' [[Bounded monotonous priority queue]].

'''Abstract Data Structure:''' [[Ordered sequence]]

[[Category: Method of an implementation of a data structure]] '''Auxiliary data:'''

[[Category:Method of an implementation of a data structure]] '''Auxiliary data:'''

[[Category:Data Structures]] '''Abstract Data Structure:''' [[Bounded priority queue]]

[[Category: Method of an implementation of a data structure]] '''Auxiliary data:'''

[[Category:Method of an implementation of a data structure]] ''' Auxiliary data:'''

'''Auxiliary data:''' Pointers <math>p</math> and <math>p'</math> of type "pointer to a B-tre ...to verify that the [[B-Trees|implementation invariants of the B-tree data structure]] and the above-mentioned loop invariants of the insert procedure are fulfi

[[Category:Method of an implementation of a data structure]] '''Auxiliary data:''' A natural number <math>\ell</math> denoting a position within the heap.

'''Abstract Data Structure:''' [[Union-find]]

'''Auxiliary data:''' ...to verify that the [[B-Trees|implementation invariants of the B-tree data structure]] and the above-mentioned loop invariants of the removal procedure are fulf

'''Auxiliary data:''' #A [[union-find]] data structure <math>U F</math> on <math>V</math>.

...to its node or, alternatively, all lists are organized in a separate data structure, for example, an array or a [[Sets and sequences#Maps|map]] such that the l