User contributions
- 08:29, 11 January 2017 (diff | hist) . . (+6) . . TADM2E 8.1
- 08:29, 11 January 2017 (diff | hist) . . (+197) . . N TADM2E 8.1 (Created page with "This is the regular editing dynamic programming, except that the diagonal as an extra possibility with cost = -1 when a swap is possible. M[I, j] = M[I-1, j-1] if A[I] == B[j...")
- 06:20, 3 January 2017 (diff | hist) . . (+233) . . TADM2E 5.31 (Implicit stack is *not* the standard practice in the real world.)
- 06:51, 2 January 2017 (diff | hist) . . (+762) . . TADM2E 5.17 (Add solution for a) and explain why solution proposed for b was incorrect.)
- 01:36, 1 January 2017 (diff | hist) . . (+231) . . TADM2E 5.15
- 01:20, 1 January 2017 (diff | hist) . . (+837) . . TADM2E 5.13 (quick description of the Red-black solution for problem 3.)
- 00:43, 1 January 2017 (diff | hist) . . (+320) . . TADM2E 5.13 (Part 2)
- 22:33, 30 December 2016 (diff | hist) . . (+177) . . TADM2E 4.45 (Put first the best solution and fix the complexity of the second one.)
- 21:52, 30 December 2016 (diff | hist) . . (+21) . . m TADM2E 4.41
- 09:52, 30 December 2016 (diff | hist) . . (+91) . . Talk:TADM2E 4.13 (current)
- 07:31, 30 December 2016 (diff | hist) . . (+51) . . Talk:TADM2E 4.4
- 05:06, 29 December 2016 (diff | hist) . . (+135) . . TADM2E 3.5 (Prettyprint using math extension) (current)
- 04:55, 29 December 2016 (diff | hist) . . (-292) . . TADM2E 3.5 (Undo revision 457 by Letientai299 (talk), the hypothesis is that all node is identical, so the child pointers in the leaf node count as overhead even if not connected)
