Search results

• Sorting Sequences of Strings
  [[Category:Algorithmic Problem]] ...esort]] (solves the [[Sorting based on pairwise comparison|generic sorting problem]])
  1,021 bytes (134 words) - 11:38, 17 May 2015
• Asymptotic complexity of algorithms
  ...inputs of an [[Algorithms and correctness#Algorithmic problem|algorithmic problem]], one or more (numerical) '''characterizing parameters''' are to be select ...n_k)</math> denote the set of all [[Algorithms and correctness#Algorithmic problem|instances]] for which these parameters assume the values <math>n_1,\ldots,n
  4 KB (700 words) - 05:54, 25 April 2016
• Find an element in a sequence
  [[Category:Algorithmic Problem]]
  495 bytes (68 words) - 19:53, 1 October 2014
• Alternating paths algorithm
  [[Category:Maximum matching problem]] '''Algorithmic Problem:''' [[Matchings in graphs]].
  1 KB (190 words) - 13:38, 27 January 2015
• String matching
  [[Category:Algorithmic Problem]] ...ath>T</math> in <math>S</math> may overlap (otherwise, the string matching problem would be trivially solvable in linear time).
  1 KB (179 words) - 19:30, 1 October 2014
• Merging two sorted sequences
  [[Category:Algorithmic Problem]]
  656 bytes (93 words) - 09:22, 20 May 2015
• One-dimensional string matching
  [[Category:Algorithmic Problem]]
  725 bytes (110 words) - 09:22, 29 April 2015
• B-tree: minimum
  '''Algorithmic Problem:'''
  735 bytes (107 words) - 11:22, 13 October 2014
• Dinic
  '''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problem (standard version)]] # Use one of the algorithms for the [[Blocking flow|blocking flow]] problem to construct a blocking flow <math>f'</math> in <math>G'</math> with respec
  2 KB (334 words) - 10:43, 8 January 2015
• B-tree: maximum
  '''Algorithmic Problem:'''
  835 bytes (136 words) - 11:21, 13 October 2014
• Median
  [[Category:Algorithmic Problem]]
  1 KB (201 words) - 12:16, 2 October 2014
• Sorting based on pairwise comparison
  [[Category:Algorithmic Problem]]
  1 KB (201 words) - 12:30, 17 May 2015
• Bubble
  '''Algorithmic problem:''' Moving the maximum element
  1 KB (257 words) - 15:01, 11 October 2014
• Binary search
  '''Algorithmic problem:''' [[Finding an element in a sorted array]]
  2 KB (298 words) - 06:29, 27 April 2016
• Algorithms and correctness
  == Algorithmic problem == An algorithmic problem is described by:
  12 KB (1,782 words) - 12:49, 28 April 2016
• Repeated depth-first search
  '''Algorithmic problem:''' [[Exhaustive graph traversal]]
  2 KB (294 words) - 07:28, 3 November 2014
• Array list: find
  '''Algorithmic problem:''' [[Ordered sequence#Find|Ordered sequence: find]]
  2 KB (262 words) - 23:10, 19 June 2015
• Array list: number
  '''Algorithmic problem:''' [[Ordered sequence#Number|Ordered sequence: number]]
  2 KB (265 words) - 23:10, 19 June 2015
• Selection sort
  '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  2 KB (327 words) - 11:05, 30 June 2015
• Genericity
  An algorithmic problem, algorithm, abstract data structure, or implementation of a data structure
  2 KB (290 words) - 12:45, 21 May 2015

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