Abstract data structure: Difference between revisions

Revision as of 02:20, 22 July 2005

Revision as of 06:49, 9 November 2005

Line 1:

'''Bold text'''<nowiki>Insert non-formatted text here</nowiki>In theoretical [[computer science]], an '''abstract data structure''' is an abstract storage for data defined in terms of the set of operations to be performed on data and [[computational complexity]] for performing these operations, regardless the implementation in a concrete [[data structure]].

Selection of an abstract data structure is crucial in design of efficient [[algorithm]]s and in estimating their computational complexity, while selection of concrete data structures is important for efficient [[implementation]] of algorithms.