User contributions for Lkw
Jump to navigation
Jump to search
26 December 2014
- 17:3517:35, 26 December 2014 diff hist +20 Main Page No edit summary
30 September 2014
- 19:5419:54, 30 September 2014 diff hist +16 B-tree: shift key to sibling →Induction step
- 19:5419:54, 30 September 2014 diff hist +3 B-tree: shift key to sibling →Induction step
- 19:4919:49, 30 September 2014 diff hist +138 B-tree: shift key to sibling →Complexity
- 19:4819:48, 30 September 2014 diff hist −2,361 B-tree: shift key to sibling No edit summary
- 19:4719:47, 30 September 2014 diff hist +1,002 B-tree: shift key to sibling →Induction Basis
- 19:2719:27, 30 September 2014 diff hist +5,219 N B-tree: shift key to sibling Created page with "Category:B-Tree Category:Algorithm == General Information == '''Algorithmic problem:''' See B-tree '''Type of algorithm:''' loop '''Auxiliary data:''' == Abstr..."
- 17:4517:45, 30 September 2014 diff hist +101 B-tree: merge two siblings →Complexity
- 17:4417:44, 30 September 2014 diff hist −1,466 B-tree: merge two siblings →Induction Step
- 17:3817:38, 30 September 2014 diff hist +1,905 B-tree: merge two siblings →Induction Basis
- 17:2517:25, 30 September 2014 diff hist −915 B-tree: merge two siblings →Abstract View
- 17:2417:24, 30 September 2014 diff hist 0 B-tree: merge two siblings →General Information
- 17:2417:24, 30 September 2014 diff hist +4,471 N B-tree: merge two siblings Created page with "Category:B-Tree Category:Algorithm == General Information == '''Algorithmic problem:''' See B-Tree '''Prerequisites:''' # A node <math>p</math> with a key at positio..."
- 17:1817:18, 30 September 2014 diff hist 0 B-tree: insert and rearrange →General Information
- 17:0717:07, 30 September 2014 diff hist −244 B-tree: insert and rearrange No edit summary
- 17:0717:07, 30 September 2014 diff hist −80 B-tree: insert and rearrange →Induction Step
- 17:0517:05, 30 September 2014 diff hist −25 B-tree: insert and rearrange →Induction Step
- 17:0417:04, 30 September 2014 diff hist −599 B-tree: insert and rearrange →Induction Step
- 17:0317:03, 30 September 2014 diff hist +1,578 B-tree: insert and rearrange →Induction Step
- 16:3116:31, 30 September 2014 diff hist +364 B-tree: insert and rearrange →Induction Step
- 16:2516:25, 30 September 2014 diff hist +102 B-tree: insert and rearrange →Induction Basis
- 16:2316:23, 30 September 2014 diff hist +230 B-tree: insert and rearrange No edit summary
- 16:1916:19, 30 September 2014 diff hist +201 B-tree: insert and rearrange No edit summary
- 16:0816:08, 30 September 2014 diff hist +2,354 N B-tree: insert and rearrange Created page with "Category:B-Tree Category:Algorithm == General Information == '''Algorithmic problem:''' Text here '''Type of algorithm:''' Text '''Auxiliary data:''' # Three po..."
25 September 2014
- 20:2520:25, 25 September 2014 diff hist +78 B-tree: split →Pseudocode
- 20:2320:23, 25 September 2014 diff hist +69 B-tree: insert →B-TREE-INSERT-NONFULL(x,k)
- 20:2120:21, 25 September 2014 diff hist +8 B-tree: insert →B-TREE-INSERT(T,k)
- 20:2120:21, 25 September 2014 diff hist −1 Master theorem →MASTER THEOREM
- 20:2020:20, 25 September 2014 diff hist +58 Master theorem →MASTER THEOREM
- 20:1820:18, 25 September 2014 diff hist +4 Master theorem →MASTER THEOREM
- 20:1720:17, 25 September 2014 diff hist +2 Master theorem →MASTER THEOREM
- 20:1620:16, 25 September 2014 diff hist +8 Master theorem →MASTER THEOREM
- 20:1420:14, 25 September 2014 diff hist +353 Master theorem →MASTER THEOREM
- 20:0820:08, 25 September 2014 diff hist +19 Master theorem →MASTER THEOREM
- 20:0720:07, 25 September 2014 diff hist +123 Master theorem →MASTER THEOREM
- 18:5118:51, 25 September 2014 diff hist +384 N Master theorem Created page with "== MASTER THEOREM == Let a ≥ 1 and b > 1 be constants, let ''f''(''n'') be a function, and let ''T''(''n'') be defined on the nonnegative integers by the recurrence ''T''(..."
- 18:3418:34, 25 September 2014 diff hist +28 Prim →MST-PRIM(G,w,r)
- 18:3318:33, 25 September 2014 diff hist +594 N Prim Created page with "== Pseudocode == === MST-PRIM(''G,w,r'') === <code> MST-PRIM(''G,w,r'') 1 '''for''' each vertex ''u'' ∈ V[''G''] 2 '''do''' ''key[''u''] = ∞ 3..."
- 17:4817:48, 25 September 2014 diff hist +8 B-tree: insert No edit summary
- 17:4417:44, 25 September 2014 diff hist +68 B-tree: insert →Pseudocode
- 16:4016:40, 25 September 2014 diff hist +7 Breadth-first search →Pseudocode
- 16:4016:40, 25 September 2014 diff hist −5 Breadth-first search →Pseudocode
- 16:3916:39, 25 September 2014 diff hist −1 Breadth-first search →Pseudocode
- 16:3016:30, 25 September 2014 diff hist −1 Breadth-first search →Pseudocode
- 16:2916:29, 25 September 2014 diff hist +4 Breadth-first search →Pseudocode
- 16:2916:29, 25 September 2014 diff hist +673 N Breadth-first search Created page with "== Pseudocode == <code> BFS(''G, s'') 1 '''for''' each vertex ''u'' ∈ ''G.V'' - {s} 2 ''u.color'' = WHITE 3 ''u.d'' = ∞ 4 ''u.''π =..."
- 16:0716:07, 25 September 2014 diff hist +747 B-tree: insert No edit summary
- 15:5615:56, 25 September 2014 diff hist +369 N B-tree: insert Created page with "<code> B-TREE-INSERT(''T'', ''k'') 1 ''r'' = ''T.root'' 2 '''if''' ''r.n'' == 2''t'' - 1 3 ''s'' = ALLOCATE-NODE() 4 ''T.root'' = ''s'' 5 ''s.leaf''..."
- 15:3215:32, 25 September 2014 diff hist +1 Bubble sort →Pseudocode
- 15:3215:32, 25 September 2014 diff hist +18 Bubble sort →Pseudocode
- 15:3115:31, 25 September 2014 diff hist +262 N Bubble sort Created page with "== Pseudocode == <code> BUBBLESORT(''A'') 1 '''for''' ''i'' = 1 '''to''' "A.length" - 1 2 '''for'' ''j'' = ''A.length'' '''downto''' ''i'' + 1 3 '''if''..."
22 September 2014
- 17:2417:24, 22 September 2014 diff hist +1 B-tree: split →Pseudocode
- 17:2417:24, 22 September 2014 diff hist −2 B-tree: split →Pseudocode
- 17:2317:23, 22 September 2014 diff hist −3 B-tree: split →Pseudocode
- 17:2317:23, 22 September 2014 diff hist 0 B-tree: split →Pseudocode
- 17:2217:22, 22 September 2014 diff hist +778 N B-tree: split Created page with "== Pseudocode == <code> B-TREE-SPLIT-CHILD(''x'', ''i'') 1 ''z'' = ALLOCATE-NODE() 2 ''y'' = ''x''.''c''iiiiiiiiiiiii 3 ''z''.''leaf'' = ''y.leaf'' 4 ''z.n'' = ''t'..."
- 16:5316:53, 22 September 2014 diff hist +6 Main Page →Tree Algorithms