Category:Data structures
From HandWiki
Here is a list of articles in the Data structures category of the Computing portal that unifies foundations of mathematics and computations using computers.
 | Pages in this category should be moved to subcategories where applicable. This category may require frequent maintenance to avoid becoming too large. It should directly contain very few, if any, pages and should mainly contain subcategories. |
In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow a more efficient algorithm to be used. The choice of the data structure must begin from the choice of an abstract data structure.
See also
Subcategories
This category has the following 12 subcategories, out of 12 total.
A
D
F
G
H
K
P
S
T
Pages in category "Data structures"
The following 33 pages are in this category, out of 33 total.
- Data structure (computing)
- Difference bound matrix (computing)
- Region (model checking) (computing)
*
- List of data structures (computing)
C
- Compressed data structure (computing)
- Conc-tree list (computing)
- Counting Bloom filter (computing)
D
- Disjoint-set data structure (computing)
- Dynamization (computing)
F
- Finger search (computing)
- Flexible array member (computing)
H
- HDT (data format) (computing)
I
- Implicit data structure (computing)
- Inversion list (computing)
J
- Join-based tree algorithms (computing)
K
- K-D heap (computing)
M
- Monoque (computing)
O
- Oblivious data structure (computing)
- Order-maintenance problem (computing)
P
- Partition refinement (computing)
- Persistent array (computing)
- Persistent data structure (computing)
- Piece table (computing)
- Predecessor problem (computing)
R
- Radix heap (computing)
- Retroactive data structure (computing)
S
- Search data structure (computing)
- Set intersection oracle (computing)
T
- Term indexing (computing)
X
- XML data binding (computing)
Z
- Zipper (data structure) (computing)
