Search results

• 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

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)