Abstract data structure: Difference between revisions

Revision as of 15:59, 27 April 2005

Revision as of 21:04, 29 May 2005

Line 3:

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.

This notion is very close to that of [[Abstract data type]] ('''ADT'''), used in theory of [[programming language]]s. A close notion of [[data model]] additionally considers the pattern of interrelations between data elements ([[structure]] of the data structure, however awkward isthat soundsmay sound).

The names of many abstract data structures (and abstract data types) match the names of concrete data structures.