Search results

Page title matches

• Three indians' algorithm
  '''Type of algorithm:''' loop. # The algorithm is named after three indian researchers, V. M. Malhotra, M. Pramodh Kumar,
  4 KB (788 words) - 11:27, 16 March 2017
• Alternating paths algorithm
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  1 KB (190 words) - 13:38, 27 January 2015
• Classical eulerian cycle algorithm
  ''' Type of algorithm:''' recursion with an arbitrarily chosen start node <math>s\in V</math> as # If <math>x\neq s</math>, terminate the algorithm with the statement that no eulerian cycle exists.
  4 KB (673 words) - 08:15, 2 November 2015
• Simple string matching algorithm
  [[Category:Algorithm]] [[Category:Main Algorithm]]
  4 KB (707 words) - 10:13, 21 September 2015

Page text matches

• B-tree: minimum
  '''Type of algorithm:''' loop ==Description of the algorithm==
  735 bytes (107 words) - 11:22, 13 October 2014
• Alternating paths algorithm
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  1 KB (190 words) - 13:38, 27 January 2015
• B-tree: maximum
  '''Type of algorithm:''' loop == Description of the algorithm ==
  835 bytes (136 words) - 11:21, 13 October 2014
• Asymptotic complexity of algorithms
  # Roughly speaking, the run time of an algorithm is measured by the number of [[Algorithms and correctness#Instructions, ope ...arded. For that, it does not matter how fast the machine and how smart the algorithm's implementation is.
  4 KB (700 words) - 05:54, 25 April 2016
• Merge
  [[Category:Algorithm]] [[Category:Auxiliary Algorithm]]
  2 KB (290 words) - 12:14, 18 September 2015
• Array list: remove
  '''Type of algorithm:''' loop ...ise, if the key to be removed is in the first array, it is removed and the algorithm terminates again (if this was the only element of the array, that array lis
  5 KB (808 words) - 23:11, 19 June 2015
• Bellman-Ford
  [[Category:Algorithm]] [[Category:Main Algorithm]]
  2 KB (393 words) - 22:51, 19 June 2015
• Bubble
  [[Category:Algorithm]] [[Category:Auxiliary Algorithm]]
  1 KB (257 words) - 15:01, 11 October 2014
• Heap as array: decrease key
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  2 KB (369 words) - 23:12, 19 June 2015
• Heap as array: extract minimum
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (438 words) - 23:13, 19 June 2015
• Array list: find
  '''Type of algorithm:''' loop # Terminate the algorithm if the end of the list is reached or, otherwise, if <math>\Kappa</math> is
  2 KB (262 words) - 23:10, 19 June 2015
• Binary search tree: remove
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  5 KB (762 words) - 13:39, 3 March 2017
• B-tree: find
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (528 words) - 13:46, 3 March 2017
• Binary search tree: remove node
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (454 words) - 13:39, 3 March 2017
• Dinic
  '''Type of algorithm :''' loop. Feasibility of <math>f</math> follows immediately from the invariant. If the algorithm terminates, the break condition immediately proves maximality along with th
  2 KB (334 words) - 10:43, 8 January 2015
• Binary search tree: find
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (425 words) - 13:38, 3 March 2017
• Heap as array: insert
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (477 words) - 23:13, 19 June 2015
• Binary search tree: insert
  '''Type of algorithm:''' loop ...o next is void, insert <math>K</math> in that empty slot and terminate the algorithm. Otherwise, proceed in that direction.
  4 KB (716 words) - 13:39, 3 March 2017
• Successive shortest paths with reduced costs
  '''Type of algorithm:''' loop ...e invariant of the [[Successive shortest paths|successive shortest paths]] algorithm.
  4 KB (757 words) - 14:39, 20 February 2015
• Eulerian cycle
  ...o see (and follows from the [[Classical eulerian cycle algorithm|classical algorithm]]) that a graph <math>G</math> is eulerian if, and only if: [[Classical eulerian cycle algorithm]]
  2 KB (307 words) - 20:57, 12 November 2014

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