Search results

• B-tree: minimum
  '''Type of algorithm:''' loop '''Auxiliary data:''' A pointer p of type "pointer to a B-tree node".
  735 bytes (107 words) - 11:22, 13 October 2014
• Merge
  [[Category:Algorithm]] [[Category:Auxiliary Algorithm]]
  2 KB (290 words) - 12:14, 18 September 2015
• B-tree: maximum
  '''Type of algorithm:''' loop '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to a B-tree node".
  835 bytes (136 words) - 11:21, 13 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
• Heap as array: insert
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (477 words) - 23:13, 19 June 2015
• Bubble
  [[Category:Algorithm]] [[Category:Auxiliary Algorithm]]
  1 KB (257 words) - 15:01, 11 October 2014
• Array list: find
  '''Type of algorithm:''' loop '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to list item of array li
  2 KB (262 words) - 23:10, 19 June 2015
• Bellman-Ford
  [[Category:Algorithm]] [[Category:Main Algorithm]]
  2 KB (393 words) - 22:51, 19 June 2015
• Array list: remove
  '''Type of algorithm:''' loop '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to array list item of ty
  5 KB (808 words) - 23:11, 19 June 2015
• Binary search tree: remove node
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (454 words) - 13:39, 3 March 2017
• Binary search tree: find
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (425 words) - 13:38, 3 March 2017
• Array list: number
  '''Type of algorithm:''' loop '''Auxiliary data:'''
  2 KB (265 words) - 23:10, 19 June 2015
• B-tree: find
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (528 words) - 13:46, 3 March 2017
• Binary search tree: remove
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  5 KB (762 words) - 13:39, 3 March 2017
• Binary search tree: insert
  '''Type of algorithm:''' loop '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to binary search tree no
  4 KB (716 words) - 13:39, 3 March 2017
• Heap as array: ascendItem
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (584 words) - 23:12, 19 June 2015
• Successive shortest paths with reduced costs
  '''Type of algorithm:''' loop '''Auxiliary data:'''
  4 KB (757 words) - 14:39, 20 February 2015
• Heap as array: descendItem
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  4 KB (635 words) - 23:12, 19 June 2015
• Bucketsort
  '''Type of algorithm:''' loop '''Auxiliary data:'''
  4 KB (744 words) - 22:51, 19 June 2015

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