Search results

Create the page "Data structures" on this wiki! See also the search results found.

Page title matches

Page text matches

• Naive algorithm
  ...ially when their efficiency can be improved by choosing more appropriate [[data structure]]s. ...rather than searched for in a linear fashion leads to the [[suffix tree]] data structure which reduces string search to mere traversal. All of these algor
  2 KB (297 words) - 15:24, 29 June 2011
• String searching
  ...h as presented is that a good hashing algorithm always examines all of the data, ''i.e.'', the entire substring of the potential match. If this is the case ==Suffix data structures==
  16 KB (2,766 words) - 19:54, 6 April 2011
• Greedy algorithm
  The basic idea of greediness may be combined with other data structures and algorithmic innovations to solve a variety of problems. The following a * [[Huffman coding]], useful in data compression, is accomplished using a classic greedy algorithm.
  3 KB (549 words) - 00:32, 14 January 2012
• Category:Pages needing code
  The articles in this category may describe algorithms and data structures in a way that is hard to understand, and would be improved by the addition
  5 members (0 subcategories, 0 files) - 06:05, 10 June 2011
• Pointer
  ...on the screen, and they may be read from and written to files. To every C data type <code>T</code> there corresponds a pointer type <code>T*</code>, and t ...are also allowed. Unlike pointers to data types, these point to code, not data.
  17 KB (2,887 words) - 19:59, 1 August 2012
• Binary heap
  ...ed analogously.) It is used to implement the [[priority queue]] [[abstract data type]]. [[Category:Data structures]]
  9 KB (1,704 words) - 08:58, 27 July 2014
• Half-open interval
  ...eq x < b</math>. It is often useful to express problems, [[algorithm]]s, [[data structure]]s, and library functions in terms of right half-open intervals o
  3 KB (517 words) - 02:56, 14 May 2012
• Heap
  Various implementations of the [[priority queue]] [[abstract data type]] are known as '''heaps'''. ...efers to the [[binary heap]] data structure. However, this is not the only data structure that is a heap; the [[binomial heap]] and [[Fibonacci heap]] are
  748 B (113 words) - 23:31, 11 December 2011
• Category:Heaps
  [[Category:Data structures]]
  3 members (0 subcategories, 0 files) - 23:32, 11 December 2011
• Cartesian tree
  [[Category:Data structures]]
  17 KB (3,062 words) - 18:02, 13 June 2016
• Category:Trees
  This category contains various kinds of trees, as well as various tree data structures.
  2 members (0 subcategories, 0 files) - 03:23, 12 December 2011
• Judge:Writing
  If any input data are strings, the input section should specify exactly which characters are ===Sample data===
  14 KB (2,336 words) - 06:15, 1 June 2012
• Talk:Binary heap
  ...running time of other algorithms that use the binary-heap as an auxiliary data structure.
  776 B (130 words) - 13:27, 9 April 2024
• Programming competition
  ...ata structure]]s and must be able to implement complex algorithms and data structures quickly and accurately. On the other hand, an algorithmic competitive progr
  3 KB (412 words) - 04:46, 28 August 2014