User contributions for JanR

22 June 2015

• 12:3112:31, 22 June 2015 diff hist +22‎ Selection sort ‎No edit summary

19 June 2015

• 15:4815:48, 19 June 2015 diff hist +21‎ Selection sort ‎ →‎Java Code
• 15:4715:47, 19 June 2015 diff hist −3‎ Selection sort ‎ →‎Java Code
• 15:4615:46, 19 June 2015 diff hist −3‎ Selection sort ‎ →‎Java Code
• 15:4615:46, 19 June 2015 diff hist +560‎ Selection sort ‎No edit summary

27 January 2015

• 15:1315:13, 27 January 2015 diff hist −1‎ Array list: remove ‎ →‎Induction step
• 15:1215:12, 27 January 2015 diff hist +852‎ Array list: remove ‎ →‎Induction step
• 14:4614:46, 27 January 2015 diff hist +5‎ Array list: remove ‎ →‎Induction basis
• 14:4214:42, 27 January 2015 diff hist +5‎ Array list: remove ‎ →‎Induction basis
• 14:4114:41, 27 January 2015 diff hist +4‎ Array list: remove ‎ →‎Abstract view
• 14:3414:34, 27 January 2015 diff hist +3,582‎ N Array list: remove ‎ Created page with "'''Algorithmic problem:''' Linear sequence: remove '''Prerequisites:''' '''Type of algorithm:''' loop '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to..."
• 14:0014:00, 27 January 2015 diff hist +310‎ Array list: number ‎No edit summary
• 13:5213:52, 27 January 2015 diff hist +1,118‎ N Array list: number ‎ Created page with "'''Algorithmic problem:''' Linear sequence: number '''Prerequisites:''' '''Type of algorithm:''' loop '''Auxiliary data:''' # A pointer <math>p</math> of type "pointer..."
• 13:3813:38, 27 January 2015 diff hist −5‎ Alternating paths algorithm ‎No edit summary current
• 13:2513:25, 27 January 2015 diff hist −154‎ Alternating paths algorithm ‎No edit summary
• 13:2113:21, 27 January 2015 diff hist +1‎ Alternating paths algorithm ‎No edit summary
• 13:2113:21, 27 January 2015 diff hist +225‎ Alternating paths algorithm ‎No edit summary
• 13:1813:18, 27 January 2015 diff hist −1‎ Alternating paths algorithm ‎No edit summary
• 13:1613:16, 27 January 2015 diff hist −11‎ Alternating paths algorithm ‎No edit summary
• 13:1613:16, 27 January 2015 diff hist +7‎ Alternating paths algorithm ‎No edit summary
• 13:1513:15, 27 January 2015 diff hist +1‎ Alternating paths algorithm ‎ →‎Complexity
• 13:1513:15, 27 January 2015 diff hist −2‎ Alternating paths algorithm ‎ →‎Complexity
• 13:1513:15, 27 January 2015 diff hist +3‎ Alternating paths algorithm ‎No edit summary
• 13:1413:14, 27 January 2015 diff hist −2‎ Alternating paths algorithm ‎ →‎Induction step
• 13:1413:14, 27 January 2015 diff hist +4‎ Alternating paths algorithm ‎ →‎Induction step
• 13:1413:14, 27 January 2015 diff hist +273‎ Alternating paths algorithm ‎No edit summary
• 13:0213:02, 27 January 2015 diff hist +3‎ Alternating paths algorithm ‎No edit summary
• 13:0113:01, 27 January 2015 diff hist +2‎ Alternating paths algorithm ‎No edit summary
• 13:0113:01, 27 January 2015 diff hist +808‎ Alternating paths algorithm ‎No edit summary

15 January 2015

• 17:3317:33, 15 January 2015 diff hist +31‎ Pivot partitioning by scanning ‎ →‎Induction step
• 17:1717:17, 15 January 2015 diff hist +331‎ Pivot partitioning by scanning ‎ →‎Induction step
• 17:1017:10, 15 January 2015 diff hist +145‎ Pivot partitioning by scanning ‎No edit summary
• 16:5916:59, 15 January 2015 diff hist +810‎ Pivot partitioning by scanning ‎No edit summary
• 16:4516:45, 15 January 2015 diff hist 0‎ Pivot partitioning by scanning ‎No edit summary
• 16:4416:44, 15 January 2015 diff hist −118‎ Pivot partitioning by scanning ‎No edit summary
• 16:4316:43, 15 January 2015 diff hist +123‎ Pivot partitioning by scanning ‎No edit summary

13 January 2015

• 15:5515:55, 13 January 2015 diff hist 0‎ Pivot partitioning by scanning ‎No edit summary
• 15:5515:55, 13 January 2015 diff hist −1‎ Pivot partitioning by scanning ‎No edit summary
• 15:5515:55, 13 January 2015 diff hist +177‎ Pivot partitioning by scanning ‎No edit summary
• 15:4415:44, 13 January 2015 diff hist +119‎ Pivot partitioning by scanning ‎No edit summary
• 15:3715:37, 13 January 2015 diff hist +84‎ Pivot partitioning by scanning ‎No edit summary
• 15:3615:36, 13 January 2015 diff hist −42‎ Pivot partitioning by scanning ‎No edit summary
• 15:3215:32, 13 January 2015 diff hist −3‎ Pivot partitioning by scanning ‎ →‎Abstract View
• 15:2515:25, 13 January 2015 diff hist +3‎ Pivot partitioning by scanning ‎No edit summary
• 15:2115:21, 13 January 2015 diff hist −38‎ Pivot partitioning by scanning ‎No edit summary
• 15:2015:20, 13 January 2015 diff hist +2‎ Pivot partitioning by scanning ‎No edit summary
• 15:2015:20, 13 January 2015 diff hist +1‎ Pivot partitioning by scanning ‎No edit summary
• 15:1915:19, 13 January 2015 diff hist −4‎ Pivot partitioning by scanning ‎No edit summary
• 15:1915:19, 13 January 2015 diff hist +161‎ Pivot partitioning by scanning ‎No edit summary
• 15:0815:08, 13 January 2015 diff hist +6‎ Pivot partitioning by scanning ‎No edit summary
• 15:0715:07, 13 January 2015 diff hist 0‎ Pivot partitioning by scanning ‎No edit summary
• 15:0615:06, 13 January 2015 diff hist +2,604‎ N Pivot partitioning by scanning ‎ Created page with " '''Algorithmic problem:''' Pivot partioning by scanning '''Prerequisites:''' None '''Type of algorithm:''' loop '''Auxiliary data:''' Five index pointers, <math>m_1,m_2,i_..."
• 14:3914:39, 13 January 2015 diff hist +58‎ Dijkstra ‎No edit summary
• 14:3014:30, 13 January 2015 diff hist +27‎ Depth-first search ‎No edit summary
• 14:2814:28, 13 January 2015 diff hist +21‎ Model computer ‎No edit summary current
• 14:2714:27, 13 January 2015 diff hist −19‎ Model computer ‎No edit summary
• 14:2614:26, 13 January 2015 diff hist −9‎ Model computer ‎No edit summary
• 14:2514:25, 13 January 2015 diff hist −2,020‎ Model computer ‎No edit summary
• 14:2514:25, 13 January 2015 diff hist −6,880‎ Model computer ‎No edit summary
• 14:1214:12, 13 January 2015 diff hist +11,446‎ Model computer ‎No edit summary

20 October 2014

• 10:3910:39, 20 October 2014 diff hist +416‎ N Single source single target shortest paths ‎ Created page with " == Input == # A directed graph <math>G=(V,A)</math> # an arc weight <math> l(a) \in \mathbb{R}</math> for each arc <math>a \in A</math> # Two nodes <math> s,t \in V </math>..." current
• 10:3210:32, 20 October 2014 diff hist −2‎ Single source shortest paths ‎No edit summary current
• 10:3010:30, 20 October 2014 diff hist −6‎ Single source shortest paths ‎No edit summary
• 10:2810:28, 20 October 2014 diff hist −8,012‎ Single source shortest paths ‎ Replaced content with " == Input == # A directed graph <math>G=(V,A)</math> # an arc weight <math> l(a) \in \mathbb{R}</math> for each arc <math>a \in A</math> # a '''root node''' <math> s \in V..."
• 10:0410:04, 20 October 2014 diff hist +8,490‎ N Single source shortest paths ‎ Created page with "Category:Sorting Algorithms Category:Divide and Conquer <div class="plainlinks" style="float:right;margin:0 0 5px 5px; border:1px solid #AAAAAA; width:auto; padding:1e..."

30 September 2014

• 18:1118:11, 30 September 2014 diff hist −26‎ Ford-Fulkerson ‎ →‎Pseudocode
• 18:1018:10, 30 September 2014 diff hist +181‎ Ford-Fulkerson ‎ →‎Pseudocode
• 17:5417:54, 30 September 2014 diff hist +5‎ Ford-Fulkerson ‎ →‎Pseudocode
• 17:4617:46, 30 September 2014 diff hist 0‎ Ford-Fulkerson ‎ →‎Abstract View
• 17:4617:46, 30 September 2014 diff hist +1‎ Ford-Fulkerson ‎ →‎Pseudocode
• 17:4217:42, 30 September 2014 diff hist +8‎ Ford-Fulkerson ‎ →‎Abstract View
• 17:4217:42, 30 September 2014 diff hist −58‎ Ford-Fulkerson ‎ →‎General Information
• 17:4117:41, 30 September 2014 diff hist −279‎ Ford-Fulkerson ‎ →‎Abstract View
• 17:3817:38, 30 September 2014 diff hist +1‎ Ford-Fulkerson ‎ →‎Complexity
• 17:3817:38, 30 September 2014 diff hist +551‎ Ford-Fulkerson ‎ →‎Complexity
• 17:2717:27, 30 September 2014 diff hist −32‎ Ford-Fulkerson ‎No edit summary
• 17:2317:23, 30 September 2014 diff hist +1‎ Ford-Fulkerson ‎ →‎Induction Basis
• 17:2317:23, 30 September 2014 diff hist 0‎ Ford-Fulkerson ‎No edit summary
• 17:2117:21, 30 September 2014 diff hist +24‎ Ford-Fulkerson ‎ →‎Induction Basis
• 17:1717:17, 30 September 2014 diff hist +8‎ Ford-Fulkerson ‎ →‎Induction Step
• 17:1617:16, 30 September 2014 diff hist +673‎ Ford-Fulkerson ‎ →‎Induction Step
• 16:5916:59, 30 September 2014 diff hist +59‎ Ford-Fulkerson ‎ →‎Induction Step
• 16:5316:53, 30 September 2014 diff hist +3,291‎ N Ford-Fulkerson ‎ Created page with "[[Category:Max-Flow] Category:Algortihms == General Information == '''Algorithmic problem:'''Max-Flow Problems '''Prerequisites:''' '''Type of algorithm:''' loop '''A..."
• 16:3916:39, 30 September 2014 diff hist −259‎ Kruskal for maximum spanning forest ‎No edit summary
• 16:1616:16, 30 September 2014 diff hist +4‎ B-tree: find ‎ →‎Pseudocode
• 16:1516:15, 30 September 2014 diff hist +419‎ B-tree: find ‎No edit summary

25 September 2014

• 17:0017:00, 25 September 2014 diff hist 0‎ Dijkstra ‎ →‎Requirements
• 16:5716:57, 25 September 2014 diff hist +1‎ Dijkstra ‎ →‎Requirements
• 16:5716:57, 25 September 2014 diff hist +74‎ Dijkstra ‎ →‎Requirements
• 16:4016:40, 25 September 2014 diff hist +9‎ Dijkstra ‎No edit summary
• 16:3916:39, 25 September 2014 diff hist 0‎ Dijkstra ‎ →‎Requirements
• 16:3716:37, 25 September 2014 diff hist +14‎ Dijkstra ‎No edit summary
• 16:3316:33, 25 September 2014 diff hist +293‎ Dijkstra ‎ →‎Pseudocode
• 15:5915:59, 25 September 2014 diff hist +131‎ Dijkstra ‎No edit summary

22 September 2014

• 17:2617:26, 22 September 2014 diff hist −350‎ Dijkstra ‎No edit summary

14 August 2014

• 17:1117:11, 14 August 2014 diff hist +188‎ Depth-first search ‎ →‎Pseudocode
• 17:0317:03, 14 August 2014 diff hist +249‎ Depth-first search ‎ →‎Pseudocode
• 16:4616:46, 14 August 2014 diff hist −923‎ Depth-first search ‎ →‎Pseudocode
• 16:4116:41, 14 August 2014 diff hist +22‎ Depth-first search ‎ →‎Pseudocode
• 16:3616:36, 14 August 2014 diff hist −12‎ Depth-first search ‎No edit summary
• 16:2816:28, 14 August 2014 diff hist +916‎ Depth-first search ‎No edit summary
• 16:2116:21, 14 August 2014 diff hist −3‎ Depth-first search ‎No edit summary
• 16:1916:19, 14 August 2014 diff hist 0‎ Depth-first search ‎No edit summary
• 16:1816:18, 14 August 2014 diff hist +22‎ Depth-first search ‎No edit summary
• 16:1716:17, 14 August 2014 diff hist +5‎ Depth-first search ‎No edit summary
• 16:1616:16, 14 August 2014 diff hist +2‎ Depth-first search ‎No edit summary
• 16:1616:16, 14 August 2014 diff hist −1‎ Depth-first search ‎No edit summary
• 16:1616:16, 14 August 2014 diff hist −3‎ Depth-first search ‎No edit summary
• 16:1616:16, 14 August 2014 diff hist +1‎ Depth-first search ‎No edit summary
• 16:1516:15, 14 August 2014 diff hist −2‎ Depth-first search ‎No edit summary
• 16:1416:14, 14 August 2014 diff hist 0‎ Depth-first search ‎No edit summary
• 16:1316:13, 14 August 2014 diff hist +734‎ Dijkstra ‎No edit summary
• 16:1316:13, 14 August 2014 diff hist +141‎ Dijkstra ‎No edit summary
• 16:1216:12, 14 August 2014 diff hist +3‎ Dijkstra ‎No edit summary
• 16:0916:09, 14 August 2014 diff hist +4‎ Dijkstra ‎No edit summary
• 16:0916:09, 14 August 2014 diff hist +22‎ Dijkstra ‎No edit summary
• 16:0816:08, 14 August 2014 diff hist +8‎ Dijkstra ‎No edit summary
• 16:0716:07, 14 August 2014 diff hist +7‎ Depth-first search ‎No edit summary
• 16:0316:03, 14 August 2014 diff hist +2‎ Depth-first search ‎No edit summary
• 16:0316:03, 14 August 2014 diff hist +1‎ Depth-first search ‎No edit summary
• 16:0216:02, 14 August 2014 diff hist +157‎ N Depth-first search ‎ Created page with "== Definition == === Pseudocode === ==== DFS(''G'') === 1 '''for''' each vertex ''u'' ∈ ''V''[''G''] 2 '''do''' color['''u'''] ← WHITE 3 4 5 6"