Search results

Jump to navigation Jump to search

  • 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
  • B-tree: merge two siblings
    [[Category:Algorithm]] '''Type of algorithm:''' loop
    4 KB (724 words) - 23:19, 19 June 2015
  • Simple string matching algorithm
    [[Category:Algorithm]] [[Category:Main Algorithm]]
    4 KB (707 words) - 10:13, 21 September 2015
  • B-tree: insert and rearrange
    [[Category:Algorithm]] '''Type of algorithm:''' Text
    4 KB (689 words) - 23:19, 19 June 2015
  • Array list: insert at position
    '''Type of algorithm:''' loop '''Auxiliary data:'''
    4 KB (628 words) - 12:57, 18 September 2015
  • B-tree: shift key to sibling
    [[Category:Algorithm]] '''Type of algorithm:''' loop
    4 KB (708 words) - 23:17, 19 June 2015
  • Pivot partitioning by scanning
    '''Type of algorithm:''' loop '''Auxiliary data:''' Five index pointers, <math>m_1,m_2,i_1,i_2,i_3 \in \mathbb N.</mat
    7 KB (1,075 words) - 08:30, 30 May 2015
  • B-tree: remove
    [[Category:Algorithm]] '''Type of algorithm:''' loop
    10 KB (1,690 words) - 13:58, 3 March 2017
  • Algorithms and correctness
    == Algorithm == # An algorithm is associated with an [[#Algorithmic problem|algorithmic problem]].
    12 KB (1,782 words) - 12:49, 28 April 2016
  • String matching based on finite automaton
    [[Category:Algorithm]] [[Category:Main Algorithm]]
    6 KB (1,053 words) - 14:36, 16 September 2015
  • B-tree: insert
    [[Category: Algorithm]] '''Type of algorithm:''' loop
    7 KB (1,135 words) - 13:47, 3 March 2017
  • Binary search tree: traverse
    '''Type of algorithm:''' loop '''Auxiliary data:'''
    6 KB (959 words) - 13:41, 3 March 2017
  • Preflow-push
    '''Also known as:''' ''push-relabel'' algorithm or ''Goldberg-Tarjan'' algorithm '''Type of algorithm:'''
    9 KB (1,560 words) - 03:53, 20 June 2017
  • Ahuja-Orlin
    '''Type of algorithm:''' loop '''Auxiliary data:'''
    8 KB (1,416 words) - 07:59, 30 November 2015
  • Prim
    '''Type of algorithm:''' loop '''Auxiliary data:'''
    5 KB (901 words) - 09:28, 21 June 2015
  • Quicksort
    '''Type of algorithm:''' recursion ...ion of all three lists, <math>S_1 + S_2 + S_3</math>, is the result of the algorithm.
    9 KB (1,575 words) - 13:36, 3 March 2017
  • Hopcroft-Karp
    '''Type of algorithm:''' loop. '''Auxiliary data:'''
    6 KB (1,029 words) - 15:00, 6 December 2014
  • Breadth-first search
    '''Type of algorithm:''' loop '''Auxiliary data:'''
    7 KB (1,165 words) - 07:50, 26 October 2015
  • Dijkstra
    '''Auxiliary data:''' ...e "frontierline" of the algorithm. We choose another variant on Dijkstra's algorithm mainly for simplicity of presentation.
    10 KB (1,765 words) - 08:35, 14 January 2021
  • Depth-first search
    '''Type of algorithm:''' loop '''Auxiliary data:'''
    11 KB (1,966 words) - 06:52, 26 October 2015
  • Kruskal for maximum spanning forest
    '''Type of algorithm:''' loop '''Auxiliary data:'''
    5 KB (812 words) - 18:31, 20 September 2015
  • Hungarian method
    '''Type of algorithm:''' loop. '''Auxiliary data:'''
    6 KB (1,033 words) - 17:26, 27 February 2015
Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/Special:Search"