User contributions for Luedecke
Jump to navigation
Jump to search
30 September 2014
- 22:3122:31, 30 September 2014 diff hist +61 Main Page →Rules
- 22:3022:30, 30 September 2014 diff hist +93 Main Page →News
- 20:2420:24, 30 September 2014 diff hist +27 Bubblesort No edit summary
- 20:2220:22, 30 September 2014 diff hist +483 Simple string matching algorithm No edit summary
- 20:1020:10, 30 September 2014 diff hist +458 Union Find No edit summary current
- 20:0520:05, 30 September 2014 diff hist −1 Selection sort No edit summary
- 20:0420:04, 30 September 2014 diff hist +463 Selection sort No edit summary
- 20:0320:03, 30 September 2014 diff hist +27 Quicksort in Place No edit summary
- 20:0220:02, 30 September 2014 diff hist +27 String matching based on finite automaton No edit summary
29 September 2014
- 20:2020:20, 29 September 2014 diff hist +4 Prim No edit summary
19 September 2014
- 22:3722:37, 19 September 2014 diff hist 0 Main Page →Graph Algorithms
- 22:3222:32, 19 September 2014 diff hist +6 User:Luedecke No edit summary
- 22:3122:31, 19 September 2014 diff hist +154 N User:Luedecke Created page with "Thomas Lüdecke Algorithmics - S202/E123 FB 20 Computer Science Department Technische Universität Darmstadt Hochschulstr. 10, D-64289 Darmstadt, Germany"
- 22:3022:30, 19 September 2014 diff hist +27 Binary search tree No edit summary
- 22:3022:30, 19 September 2014 diff hist +27 Hashtable No edit summary
- 22:2922:29, 19 September 2014 diff hist +27 Heaps No edit summary current
- 22:2922:29, 19 September 2014 diff hist +27 Doubly-linked list No edit summary
- 22:2222:22, 19 September 2014 diff hist +27 Kruskal for maximum spanning forest No edit summary
- 22:2122:21, 19 September 2014 diff hist +22 Bubble No edit summary
- 22:2022:20, 19 September 2014 diff hist 0 m Bubble Luedecke moved page Bubble Sort to Bubble over redirect: BUBBLE SORT != BUBBLE
- 22:1922:19, 19 September 2014 diff hist 0 m Bubble Luedecke moved page Bubble to Bubble Sort
- 22:1922:19, 19 September 2014 diff hist +27 Mergesort No edit summary
- 22:1822:18, 19 September 2014 diff hist +27 Bucketsort No edit summary
- 22:1822:18, 19 September 2014 diff hist +27 Linked list No edit summary
- 22:1722:17, 19 September 2014 diff hist +3,531 Main Page Undo revision 193 by Luedecke (talk)
17 September 2014
- 00:1900:19, 17 September 2014 diff hist −3,531 m Main Page Reverted edits by Luedecke (talk) to last revision by MediaWiki default
- 00:1500:15, 17 September 2014 diff hist −3 Main Page →News
- 00:1300:13, 17 September 2014 diff hist −37 Main Page →Tree Algorithms
- 00:1200:12, 17 September 2014 diff hist −5 Main Page →Other Algorithms (LOCKED)
- 00:1200:12, 17 September 2014 diff hist +16 Main Page →Sorting Algorithms
- 00:1100:11, 17 September 2014 diff hist −16 Main Page →Other Data Structures (LOCKED)
- 00:1100:11, 17 September 2014 diff hist +21 Main Page →To Do
- 00:0900:09, 17 September 2014 diff hist +405 Main Page →Other Algorithms (LOCKED)
- 00:0400:04, 17 September 2014 diff hist +33 Main Page →Other Algorithms (LOCKED)
13 September 2014
- 16:0016:00, 13 September 2014 diff hist +61 N B-tree: minimum Created page with "Minimum(x) :while leaf(x) = false ::x = c1(x) :return key1(x)"
- 15:5915:59, 13 September 2014 diff hist +42 Main Page →Tree Algorithms
- 11:3011:30, 13 September 2014 diff hist +377 N Binary search tree: remove Created page with "TREE-DELETE(T,z) :if left[z] = NULL or right[z] = NULL ::then y = z ::else y = TREE-SUCCESSOR(z) :if left[y] ≠ NULL ::then x = left[y] ::else x = right[y] :if x ≠ NULL ::t..."
- 11:2411:24, 13 September 2014 diff hist +254 N Binary search tree: insert Created page with "TREE-INSERT(T, z) :y = Null :x = root(T) :while x ≠ NULL ::y = x ::if key[z] < key[x] :::then x = left[x] :::then x = right[x] :p[z] = y :if y = NULL ::then root[T] = z //Tr..."
- 11:1311:13, 13 September 2014 diff hist +71 N Binary search tree: maximum Created page with "TREE-MAXiMUM (x) :while right[x] ≠ NULL ::x = right[x] :return key[x]"
- 11:1211:12, 13 September 2014 diff hist +69 N Binary search tree: minimum Created page with "TREE-MINIMUM (x) :while left[x] ≠ NULL ::x = left[x] :return key[x]"
- 11:0911:09, 13 September 2014 diff hist +66 Main Page →Tree Algorithms
- 10:2510:25, 13 September 2014 diff hist +114 N Binary search tree: traverse Created page with ":INORDER-TREE-WALK(x) ::if x ≠ NULL :::INORDER-TREE-WALK(left[x]) :::print key[x] :::INORDER-TREE-WALK(right[x])"
- 10:2210:22, 13 September 2014 diff hist +156 N Binary search tree: find Created page with ":TREE-SEARCH (x, k) ::if x= NIL or k = key[x] :::then return x ::if k < key[x] :::then return TREE-SEARCH(left[x], k) ::else return TREE-SEARCH(right[x], k)"
11 September 2014
- 23:3923:39, 11 September 2014 diff hist +27 Dijkstra No edit summary
- 23:3723:37, 11 September 2014 diff hist +19 N File:Olw logo1.png Open Learnware Logo current
- 23:3423:34, 11 September 2014 diff hist 0 Main Page →Other Algorithms (LOCKED)
- 23:3423:34, 11 September 2014 diff hist 0 Main Page →Graph Algorithms
- 23:3423:34, 11 September 2014 diff hist +144 Main Page →Problems
- 23:2523:25, 11 September 2014 diff hist +289 Main Page →Tree Algorithms
- 23:1823:18, 11 September 2014 diff hist +14 Main Page →Graph Algorithms