Data structure/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Daniel Mietchen m (Robot: Creating Related Articles subpage) |
imported>Daniel Mietchen m (Robot: encapsulating subpages template in noinclude tag) |
||
| Line 1: | Line 1: | ||
{{subpages}} | <noinclude>{{subpages}}</noinclude> | ||
==Parent topics== | ==Parent topics== | ||
Revision as of 16:11, 11 September 2009
- See also changes related to Data structure, or pages that link to Data structure or to this page or whose text contains "Data structure".
Parent topics
Subtopics
Bot-suggested topics
Auto-populated based on Special:WhatLinksHere/Data structure. Needs checking by a human.
- Algorithm [r]: A sequence of steps used to solve a problem. [e]
- Hash table [r]: in computer science, is an unordered, dictionary-like data structure that provides very efficient insertion, deletion or lookup of elements. [e]
- Linked list [r]: In computer science, a type of ordered collection in which each item contains a reference to the item that follows it. [e]
- Lisp [r]: A high-level, functional computer programming language with close historical ties to artificial intelligence research. [e]
- Locality of reference [r]: A commonly observed pattern in memory accesses by a computer program over time. [e]
- Pointer (computer science) [r]: The memory address of some data in computer science. [e]
- Stack frame [r]: A memory management strategy used to create and destroy temporary (automatic) variables in some programming languages. [e]
- Stack [r]: Abstract data type in computer science that supports last-in first-out (LIFO) access to its contents. [e]