Category:Data structures

From Biocrawler, the free encyclopedia.

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.be:Катэгорыя:Структуры дадзеных da:Kategori:Datastruktureres:Category:Estructura de datos ja:Category:データ構造 pl:Kategoria:Struktury danych ru:Category:Структуры данных zh:Category:数据结构

Subcategories

There is 1 subcategory to this category.

T

• Trees (structure)

Articles in category "Data structures"

There are 53 articles in this category.

2 2-3 heap A Abstract data structure Adjacency list Array Associative array B Binary decision diagram Bit array Bloom filter Buffer gap C Crit bit tree D Data structure Database Source Name Database dump Deque Disjoint-set data structure Dope vector F Fibonacci heap

G Global array Graph (data structure) Graph-structured stack H Hash table Heap I Iliffe vector J Judy array L Linked list List List of data structures List of publications in computer science Literal pool Lookup table M Matrix representation Mutual exclusion N Navigation mesh P Packed storage matrix Parallel array

P cont. Persistent data structure Priority queue Process control block Q Queue R Raster graphics Relocation table S Scene graph Skip list Soft heap Sparse array Stack (computing) String (computer science) T Tagged union Tree data structure U Union (computer science) Unrolled linked list V VList X Xor linked list

Wikipedia (http://en.wikipedia.org/wiki/Main_Page) Category:Data_structures (http://en.wikipedia.org/wiki/Category:Data_structures) version history (http://en.wikipedia.org/w/index.php?title=Category:Data_structures&action=history) GNU Free Documentation Lizenz (http://en.wikipedia.org/wiki/Wikipedia:Text_of_the_GNU_Free_Documentation_License) CC-by-sa (http://creativecommons.org/licenses/by-sa/2.5/)

---