Search results

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

• Main Page
  * to organize and provide information about algorithms, data structures, and other things of interest in computer science for future generations of
  2 KB (311 words) - 12:38, 10 January 2018
• Stack
  A '''stack''' is a data structure containing zero or more items, all of the same type, which suppor remove tail of L, returning its data element
  6 KB (1,084 words) - 04:48, 5 March 2011
• Queue
  A '''queue''' is a data structure containing zero or more items, all of the same type, which suppor remove head of L, returning its data element
  6 KB (1,081 words) - 04:48, 5 March 2011
• Dijkstra's algorithm
  ...he precise time complexity of Dijkstra's depends on the nature of the data structures used; read on.) ...to make optimizations, and more closely follows the theory, but requires a data structure <code>Q</code>:
  8 KB (1,489 words) - 05:45, 31 May 2011
• Deque
  A '''deque''' (pronounced /dɛk/ or /dik/) is a data structure containing zero or more items, all of the same type, which may be ...e possible; here the term ''queue'' is the name of a general class of data structures which allow insertion and removal of elements (but not search). The ''first
  9 KB (1,494 words) - 03:35, 4 March 2011
• Prim's algorithm
  ...cise time complexity of Prim's algorithm depends on the nature of the data structures used.
  6 KB (1,007 words) - 05:47, 31 May 2011
• Segment tree
  The '''segment tree''' is a highly versatile [[data structure]], based upon the [[Divide and conquer|divide-and-conquer]] parad ...tion of the elements in its associated interval but also a function of the data stored in its children.
  21 KB (3,669 words) - 02:34, 6 April 2016
• Convex hull trick
  The '''convex hull trick''' is a technique (perhaps best classified as a data structure) used to determine ''efficiently'', after preprocessing, which me ...details) and add lines one by one until all lines have been added and our data structure is complete.</p>
  19 KB (3,419 words) - 02:24, 13 September 2023
• Optimization
  ==Data structures== In other types of problems, use of proper data structures can result in a significant decrease in running time. Often this can make t
  7 KB (1,155 words) - 01:34, 5 January 2012
• Longest palindromic substring
  ...problem can be solved in <math>O(N \log N)</math> time using standard data structures from the literature, the [[suffix tree]] and the [[suffix array]].
  19 KB (3,066 words) - 10:05, 1 November 2016
• Disjoint sets
  ...ref><ref>M. Fredman and M. Saks. The cell probe complexity of dynamic data structures. ''Proceedings of the Twenty-First Annual ACM Symposium on Theory of Comput [[Category:Data structures]]
  13 KB (2,270 words) - 01:29, 11 December 2011
• Array
  ...rganize information internally. In particular, an array is often the ideal data structure for a finite [[sequence]]. ...y default. An associative array is not a type of array, but a more complex data structure named in analogy to the array.
  17 KB (2,904 words) - 03:08, 17 April 2012
• Linked list
  The '''linked list''', often referred to simply as a ''list'', is a data structure that organizes a [[sequence]] of objects, all of the same type an [[Category:Data structures]]
  5 KB (905 words) - 02:16, 30 December 2011
• Tree
  ...Binary trees are of special interest because of their ability to organize data, as in [[binary search tree]]s and [[binary heap]]s. ...whereas in others, the external nodes are sentinels, and in others still, data are stored only in leaves. The first convention is the one used in [[ACSL]]
  17 KB (2,906 words) - 03:22, 12 December 2011
• Topological sort
  ...ion to Algorithms'' course, which may depend on the ''Introduction to Data Structures'' course, which may in turn depend on the ''Introduction to Programming'' c
  9 KB (1,677 words) - 11:36, 25 January 2012
• Longest common substring
  The fastest solutions are obtained using suffix data structures.
  7 KB (1,242 words) - 04:49, 29 May 2011
• Algorithm
  ...ly follow simple, precise, well-defined instructions. Together with [[data structures]], algorithms form the foundation of computer science. Many algorithms have ...d carefully fleshed out; in particular, the programmer must decide which [[data structure]]s to use, and this often determines the efficiency of the result
  10 KB (1,628 words) - 18:12, 28 June 2011
• Data structure
  ...d programming languages]], as the name implies, automatically organize all data onto a [[stack]]. ...uctures form the foundation of computer science. Choosing appropriate data structures for the implementation of an algorithm can greatly boost the algorithm's ef
  9 KB (1,544 words) - 02:06, 20 March 2011
• 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