Search results

Page title matches

• Data structure
  Based solely on the access functions provided by the data structure interface one can roughly distinguish three main kinds: ...this is not possible because the actual representation of the data in the data structure has an important role in the problem to solve e.g. in [[parse tree|parse tr
  8 KB (1,250 words) - 17:01, 4 August 2024
• Data structure/Approval
  12 bytes (1 word) - 08:18, 26 September 2007
• Data structure/Definition
  118 bytes (16 words) - 17:55, 1 June 2008
• Data structure/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Data structure]]. Needs checking by a human.
  713 bytes (97 words) - 17:01, 4 August 2024

Page text matches

• Hash table/Definition
  in computer science, is an unordered, dictionary-like data structure that provides very efficient insertion, deletion or lookup of elements.
  176 bytes (22 words) - 04:54, 6 January 2010
• Algorithm
  ...consistent [[data structure]]. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on which the recipe is designed to operate.
  2 KB (283 words) - 12:47, 18 July 2024
• Pointer (computer science)
  ''Main Articles:'' [[data structure]] and [[abstract data type]] ...may be redefined, they are the fundamentally mutability that allows for a data structure to change over time.
  5 KB (695 words) - 20:34, 21 January 2009
• Linked list
  A '''linked list''' is a simple [[data structure]] in which each [[object]] (or ''[[node]]'') contains a link (or reference)
  3 KB (426 words) - 12:00, 12 September 2024
• Tree (disambiguation)
  * [[Data_structure#Tree|Tree (data structure)]]: In design of computer software
  627 bytes (86 words) - 21:50, 29 September 2020
• Data structure
  Based solely on the access functions provided by the data structure interface one can roughly distinguish three main kinds: ...this is not possible because the actual representation of the data in the data structure has an important role in the problem to solve e.g. in [[parse tree|parse tr
  8 KB (1,250 words) - 17:01, 4 August 2024
• Pointer (computer science)/Related Articles
  {{r|Data structure}}
  505 bytes (65 words) - 19:36, 11 January 2010
• Locality of reference/Related Articles
  {{r|Data structure}}
  360 bytes (43 words) - 17:01, 12 September 2024
• Erlang (programming language)/Tutorials/ETS
  Data structure options include:
  2 KB (313 words) - 07:07, 8 August 2009
• Discrete logarithm/Related Articles
  {{r|Data structure}}
  461 bytes (58 words) - 17:00, 7 August 2024
• Lisp/Related Articles
  {{r|Data structure}}
  398 bytes (48 words) - 12:01, 12 September 2024
• Stack/Related Articles
  {{r|Data structure}}
  606 bytes (79 words) - 20:34, 11 January 2010
• Erlang (programming language)/Tutorials/gb sets
  will give the fastest access time of most any alternative data structure.
  1 KB (155 words) - 07:07, 8 August 2009
• Integer/Related Articles
  {{r|Data structure}}
  2 KB (265 words) - 12:01, 1 September 2024
• Flat file database
  ...t [[file]]. A [[hierarchical data structure|hierarchical]] or [[relational data structure]] may contain several data tables, and hence be regarded as comprising seve ...age, whether or not the program really stored the data table as a relevant data structure ([[array]], [[matrix]], [[vector]] of records, complex [[object]]...).
  10 KB (1,624 words) - 07:00, 17 August 2024
• Stack frame/Related Articles
  {{r|Data structure}}
  794 bytes (107 words) - 13:40, 29 April 2011
• Locality of reference
  Typically this occurs with referential [[data structure|data structures]] like [[linked list|linked lists]] if the elements are spr
  4 KB (634 words) - 17:01, 12 September 2024
• Linked list/Related Articles
  {{r|Data structure}}
  624 bytes (83 words) - 12:00, 12 September 2024
• DNA microarray/Related Articles
  {{r|Data structure}}
  590 bytes (76 words) - 07:01, 4 August 2024
• Hash table/Related Articles
  {{r|Data structure}}
  652 bytes (86 words) - 07:00, 26 August 2024