Search results

Page title matches

• Sorted sequence
  [[Category:Sequence]] # The abstract data structure '''sorted sequence''' implements sorted sequences as defined [[Sets and sequences#Ordered and
  2 KB (270 words) - 13:06, 21 May 2015
• Ordered sequence
  [[Category:Sequence]] # The abstract data structure '''ordered sequence''' implements sorted sequences as defined [[Sets and sequences|here]].
  2 KB (252 words) - 12:52, 21 May 2015
• Find an element in a sequence
  # A sequence <math>S</math>. # [[Find element in sequence iteratively]]
  495 bytes (68 words) - 19:53, 1 October 2014

Page text matches

• Find an element in a sequence
  # A sequence <math>S</math>. # [[Find element in sequence iteratively]]
  495 bytes (68 words) - 19:53, 1 October 2014
• Union-find with lists
  ...<math>\{1,\ldots,N\}</math> and component type "[[Ordered sequence|ordered sequence]] of integral numbers". # Each non-empty sequence in this array contains one of the partition sets, that is:
  3 KB (419 words) - 14:27, 20 June 2015
• Sorted sequence
  [[Category:Sequence]] # The abstract data structure '''sorted sequence''' implements sorted sequences as defined [[Sets and sequences#Ordered and
  2 KB (270 words) - 13:06, 21 May 2015
• Ordered sequence
  [[Category:Sequence]] # The abstract data structure '''ordered sequence''' implements sorted sequences as defined [[Sets and sequences|here]].
  2 KB (252 words) - 12:52, 21 May 2015
• Main Page
  *** [[Find an element in a sequence]] (DONE) *** [[Insert an element in a sequence]] (Empty in old wiki?!)
  4 KB (380 words) - 15:13, 30 November 2020
• Array list: find
  '''Algorithmic problem:''' [[Ordered sequence#Find|Ordered sequence: find]] '''Statement:''' Linear in the length of the sequence in the worst case.
  2 KB (262 words) - 23:10, 19 June 2015
• Array list: number
  '''Algorithmic problem:''' [[Ordered sequence#Number|Ordered sequence: number]] '''Statement:''' Linear in the length of the sequence in the worst case (if the arrays of all array list items have identical len
  2 KB (265 words) - 23:10, 19 June 2015
• Binary search tree: find
  ...style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">[[Sorted sequence]]</div> '''Algorithmic Problem:''' [[Sorted sequence#Find|Sorted Sequence:find]]
  3 KB (425 words) - 13:38, 3 March 2017
• Exhaustive graph traversal
  A sequence of all nodes of <math>G</math>.
  195 bytes (27 words) - 07:21, 3 November 2014
• Sets and sequences
  An '''ordered sequence''' (or '''sequence''', for short) is given by ...e sequence (a.k.a. the '''indexes'''). The element <math>\pi (i)</math> of sequence <math>S</math> at position <math>i</math> is denoted by <math>S[i]</math>.
  5 KB (783 words) - 12:24, 21 May 2015
• Array list
  '''Abstract Data Structure:''' [[Ordered sequence]] ...e components <math>A[1|,\ldots,A[n]</math> are the elements of the ordered sequence that are stored in this item (in this order).
  1 KB (227 words) - 09:59, 21 September 2015
• Array list: insert at position
  '''Algorithmic problem:''' [[Ordered sequence#Insert at position|Ordered sequence: insert at position]] ...hat, in an implementation of [[Ordered sequence#Insert at position|Ordered sequence: insert at position]], we may assume <math>l \leq</math>number(). Therefore
  4 KB (628 words) - 12:57, 18 September 2015
• Binary search tree: insert
  ...style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">[[Sorted sequence]]</div> '''Algorithmic problem:''' [[Sorted sequence#Insert|Sorted sequence: insert]]
  4 KB (716 words) - 13:39, 3 March 2017
• Binary search tree: remove
  ...style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">[[Sorted sequence]]</div> '''Algorithmic Problem:''' [[Sorted sequence#Remove|Sorted sequence:remove]]
  5 KB (762 words) - 13:39, 3 March 2017
• Sorting Algorithms
  Let <math>n \in \N</math> and <math>a = a_0, \dots, a_{n-1}</math> a finit sequence with <math>a_i \in \N \quad (i = 0, \dots, n-1)</math> The ''sorting problem'' is to find a sequence <math>a_{\varphi (0)}, \dots, a_{\varphi (n-1)}</math> with folloing constr
  2 KB (230 words) - 14:21, 12 November 2014
• Binary search tree
  [[Sorted sequence]] * Besides the methods of [[Sorted sequence|sorted sequences]], binary search trees in the implementation chosen here h
  2 KB (353 words) - 06:14, 6 July 2015
• Graph traversal
  An [[Sets and sequences#Ordered and sorted sequences|ordered sequence]], whose content is a permutation of all nodes of <math>G</math> that can b ...thms deliver specific additional output besides the above-mentioned output sequence. In each case, additional output is specified on the page of the respective
  2 KB (314 words) - 19:06, 9 November 2014
• Array list: remove
  '''Algorithmic problem:''' [[Ordered sequence#Remove|Ordered sequence: remove]] '''Statement:''' Linear in the length of the sequence in the worst case.
  5 KB (808 words) - 23:11, 19 June 2015
• Binary search tree: remove node
  ...style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">[[Sorted sequence]]</div> ...dot n)</math> in the worst case, where <math>n</math> is the length of the sequence, <math>h</math> the height of the tree, and <math>T</math> the complexity o
  3 KB (454 words) - 13:39, 3 March 2017
• Quicksort
  '''Invariant:''' After a recursive call, the input sequence of this recursive call is sorted. '''Variant:''' In each recursive call, the sequence of the callee is strictly shorter than that of the caller.
  9 KB (1,575 words) - 13:36, 3 March 2017
• Merging two sorted sequences
  A sorted sequence <math>S</math>, whose element set is the union of the element sets of <math
  656 bytes (93 words) - 09:22, 20 May 2015
• One-dimensional string matching
  A [[Sets and sequences#Ordered and sorted sequences|sorted sequence]] <math>R</math> of integral values from <math>\{ 1,...,n\}</math> such tha
  725 bytes (110 words) - 09:22, 29 April 2015
• Bucketsort
  # An ordered sequence <math>S'</math> of strings, which will eventually hold the overall result o ...trings, that is, the ones with length at least <math>N - i + 1</math>. The sequence <math>S'</math> is sorted according to the following definition of comparis
  4 KB (744 words) - 22:51, 19 June 2015
• Mergesort
  '''Invariant:''' After a recursive call, the input sequence of this recursive call is sorted. '''Abstract view:''' The sequence is divided into two subsequences of approximately half size, it does not ma
  4 KB (617 words) - 13:36, 3 March 2017
• Bounded monotonous priority queue
  [[Category:Sequence]]
  1 KB (151 words) - 14:33, 17 October 2014
• Pivot partioning
  # An [[Sets and sequences#Ordered and sorted sequences|ordered sequence]] <math>S</math> of length <math>n</math>.
  706 bytes (118 words) - 13:34, 5 May 2015
• B-tree: find
  '''Algorithmic problem:''' [[Sorted sequence#Find|Sorted sequence: find]]
  3 KB (528 words) - 13:46, 3 March 2017
• Sorting Sequences of Strings
  An [[Sets and sequences#Ordered and sorted sequences|ordered sequence]] <math>S</math> of length <math>n \in \mathbb{N}_{0}</math> and component
  1,021 bytes (134 words) - 11:38, 17 May 2015
• Median
  An [[Sets and multisets#Ordered and sorted sequences|ordered sequence]] <math>S</math> of length <math>n</math> such that a [[Genericity#Comparis
  1 KB (201 words) - 12:16, 2 October 2014
• Binary search tree: traverse
  '''Algorithmic problem:''' [[Sorted sequence#Traverse|Sorted sequence: traverse]] '''Statement:''' Linear in the length of the sequence in the worst case.
  6 KB (959 words) - 13:41, 3 March 2017
• Sorting based on pairwise comparison
  # An [[Sets and sequences#Ordered and sorted sequences|ordered sequence]] <math>S</math> of length <math>n</math>.
  1 KB (201 words) - 12:30, 17 May 2015
• Classical eulerian cycle algorithm
  ...tional input. Before the proper recursive procedure is invoked, the output sequence <math>S</math> is initialized so as to contain the start node <math>s</math ...dynamically growing) path, represented in <math>p</math> as an alternating sequence of nodes and edges/arcs.
  4 KB (673 words) - 08:15, 2 November 2015
• Basic graph definitions
  ...raph is a finite [[Sets and sequences#Ordered and sorted sequences|ordered sequence]] <math>(\{v_1,v_2\},\{v_2,v_3\}\dots,\{v_{k-2},v_{k-1}\},\{v_{k-1},v_k\})< ...th> is a finite [[Sets and sequences#Ordered and sorted sequences|ordered sequence]] <math>((v_1,v_2),(v_2,v_3),\ldots,(v_{k-2},v_{k-1}),(v_{k-1},v_k))</math>
  15 KB (2,712 words) - 14:47, 16 May 2015
• Kruskal for maximum spanning forest
  ...with the largest value of <math>\ell(e)</math> is the first element of the sequence (ties arbitrarily broken). Below, <math>e_i</math> denotes the <math>i</mat
  5 KB (812 words) - 18:31, 20 September 2015
• Depth-first search
  ...lly, the only member of the output sequence; otherwise, the initial output sequence is empty. Arborescence <math>A</math> is initialized so as to contain <math ...tput order is the lexicographical one: Append <math>w</math> to the output sequence.
  11 KB (1,966 words) - 06:52, 26 October 2015
• Algorithms and correctness
  ...xecuting the instruction on a machine means that the machine performs this sequence of operations. Instructions may be bundled as '''subroutines''' (a.k.a. ''' A '''program''' is a sequence of instructions in some programming language. A program written in a higher
  12 KB (1,782 words) - 12:49, 28 April 2016
• Directed Tree
  ...nd let <math>i</math> be the position of <math>(w,v)</math> in the ordered sequence of outgoing arcs of <math>w</math>. Then the '''range''' of <math>v</math> The sorted sequence of all keys in a binary search tree is the left-root-right order.
  7 KB (1,284 words) - 11:29, 26 May 2015
• Eulerian cycle
  A eulerian cycle as an alternating sequence of nodes and edges/arcs or, alternatively, the (correct) message that the g
  2 KB (307 words) - 20:57, 12 November 2014
• Strings
  ...gma</math> is an [[Sets and sequences#Ordered and sorted sequences|ordered sequence]] of characters of <math>\Sigma</math>.
  2 KB (391 words) - 11:39, 17 May 2015
• Breadth-first search
  ...is seen. The start node is the only element of <math>Q</math>. The output sequence is empty and the arborescence <math>A</math> contains the start node <math> # Append <math>v</math> to the output sequence.
  7 KB (1,165 words) - 07:50, 26 October 2015
• Priority queue
  [[Category:Sequence]]
  3 KB (418 words) - 15:33, 4 October 2014
• B-tree: insert
  '''Algorithmic problem:''' [[Sorted sequence#Insert|Sorted sequence: insert]]
  7 KB (1,135 words) - 13:47, 3 March 2017
• Bounded priority queue
  [[Category:Sequence]]
  3 KB (511 words) - 06:43, 19 October 2015
• B-tree
  '''Abstract data structure:''' [[Sorted sequence]]
  3 KB (541 words) - 13:49, 26 May 2015
• B-tree: remove
  '''Algorithmic problem:''' [[Sorted sequence#Remove|Sorted sequence: remove]]
  10 KB (1,690 words) - 13:58, 3 March 2017
• Simple string matching algorithm
  '''Auxiliary data''' An [[ordered sequence]] <math>I</math> of natural numbers.
  4 KB (707 words) - 10:13, 21 September 2015
• Kosaraju
  ...C_j</math> which appears after all nodes of <math>C_i</math> in the output sequence of step 1 (because it is finished in [[Depth-first search|DFS]] after the n
  4 KB (789 words) - 07:37, 2 November 2015
• Asymptotic complexity of algorithms
  ...ps, and sequences]] and the (maximum) size of an element in a set, map, or sequence.
  4 KB (700 words) - 05:54, 25 April 2016
• Pivot partitioning by scanning
  ...e values of <math>m_1</math> and <math>m_2</math> only depend on the input sequence <math>S</math> and are, hence, constant throughout the loop. More specifica
  7 KB (1,075 words) - 08:30, 30 May 2015
• Preflow-push with excess scaling
  # A sequence of iterations between two successive changes of <math>\Delta</math> is usua
  5 KB (916 words) - 17:29, 18 December 2017
• Branching by Edmonds
  ...ration performs some bookkeeping: For the super-node, a cyclically ordered sequence of all nodes and arcs on <math>C</math> (or an equivalent bulk of informati
  7 KB (1,243 words) - 07:59, 8 November 2015
• Negative cycle-canceling
  ...3,v_2)>f_2(v_3,v_2)</math>. This argument may be continued, so we obtain a sequence <math>v_1,v_2,v_3,v_4,\ldots</math> such that for all <math>i=1,2,3,\ldots<
  7 KB (1,256 words) - 15:18, 5 February 2015
• Ahuja-Orlin
  Finally, the sequence of outgoing arcs is passed once for each node in step 3.1 between two incre
  8 KB (1,416 words) - 07:59, 30 November 2015