A data structure is a defined way of organizing and storing data so that it can be accessed and changed efficiently, such as a list, a tree or a table of key and value pairs. Choosing the right data structure for a problem is often the decision that matters most for a program's performance, more than the choice of algorithm run on top of it, because the shape of the data determines which operations are fast and which are slow. Donald Knuth's The Art of Computer Programming, whose first volume, Fundamental Algorithms, appeared in 1968, gave the field one of its first systematic, mathematically rigorous surveys of data structures alongside the algorithms that operate on them.
Connections
Associated With
Donald Knuth, Scientists Knuth's multi-volume The Art of Computer Programming (from 1968) is the canonical systematic treatment of data structures and algorithms in computer science.
Data structures are implemented and manipulated through constructs a programming language provides
Belongs To
Source Data Structure (Wikipedia)
Studied In
Source Data Structure (Wikipedia)
In the Other Atlases
Informed
Also in Technology and Engineering Atlas: which this subject informed.
Sources
Data Structure (Wikipedia)
WikipediaLead section
A data structure is a way to organize and store data that is usually chosen for efficient access to data.
Belongs To: Computer Science, Lead sentence
In computer science, a data structure is a way to organize and store data that is usually chosen for efficient access to data.
View the Source Donald Knuth (Wikipedia)
WikipediaBiography sectionQuote, Biography section
Knuth has been called the "father of the analysis of algorithms".
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.