Difference between revisions of "Data structure"
Karl Jones (Talk | contribs) (etc) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 25: | Line 25: | ||
* [[Computer science]] | * [[Computer science]] | ||
* [[Data type]] | * [[Data type]] | ||
| + | * [[Linked list]] | ||
* [[Random access]] | * [[Random access]] | ||
Revision as of 07:26, 20 February 2016
In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently.
Description
Data structures can implement one or more particular abstract data types, which are the means of specifying the contract of operations and their complexity. In comparison, a data structure is a concrete implementation of the contract provided by an ADT.
Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks.
- For example, databases use B-tree indexes for small percentages of data retrieval and compilers and databases use dynamic hash tables as look up tables.
Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services.
Algorithms
Usually, efficient data structures are key to designing efficient algorithms.
Design methods
Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.
See also
External links
- Data structure @ Wikipedia
