User contributions
Jump to navigation
Jump to search
- 17:29, 28 September 2020 diff hist +95 Main Page
- 17:27, 28 September 2020 diff hist +27 Main Page
- 17:26, 28 September 2020 diff hist +713 Main Page
- 14:13, 21 September 2020 diff hist 0 Chapter 8 →Shortest Paths
- 14:12, 21 September 2020 diff hist +238 N 8.29 Created page with "1. Find maximum matching. Bipartite matching is described in the book. General matching would require Edmonds Blossom algorithm. 2. Include an arbitrary edge for every uncover..." current
- 14:12, 21 September 2020 diff hist +438 N 8.27 Created page with "The problem reduces to Floyd - Warshall algorithm if you take logs of all currency-exchange rates, as if a * b = c then ln(a) + ln(b) = ln(c). In computational finance people..." current
- 14:11, 21 September 2020 diff hist +561 N 8.25 Created page with "Step 1: Perform topological sorting of the graph (we can do it as Graph is acyclic). This is O(n + m) Step 2: Go through vertices in topological order. Initially all vertic..." current
- 14:10, 21 September 2020 diff hist +23 N 8.23 Created page with " Back to Chapter 8" current
- 14:10, 21 September 2020 diff hist +1 Chapter 8 →Shortest Paths
- 14:09, 21 September 2020 diff hist +23 N 8.21 Created page with " Back to Chapter 8" current
- 14:09, 21 September 2020 diff hist +23 N 8.19 Created page with " Back to Chapter 8" current
- 14:09, 21 September 2020 diff hist +23 N 8.17 Created page with " Back to Chapter 8" current
- 14:09, 21 September 2020 diff hist +23 N 8.15 Created page with " Back to Chapter 8" current
- 14:08, 21 September 2020 diff hist +18 Chapter 8 →Shortest Paths
- 14:07, 21 September 2020 diff hist +23 N 8.13 Created page with " Back to Chapter 8" current
- 14:07, 21 September 2020 diff hist +23 N 8.11 Created page with " Back to Chapter 8" current
- 14:07, 21 September 2020 diff hist +23 N 8.9 Created page with " Back to Chapter 8" current
- 14:07, 21 September 2020 diff hist +23 N 8.7 Created page with " Back to Chapter 8" current
- 14:06, 21 September 2020 diff hist +252 N 8.5 Created page with "In both algorithms, an edge can only ever be picked once, so they will both eventually terminate regardless of negative edge weights. I also suspect that they still generate..." current
- 14:06, 21 September 2020 diff hist +252 N 8.3 Created page with "No. Counter example provided below: G(V,E,W) = ((A,B,C,D),({A,B},{B,C},{C,D},{D,A}),(1,2,3,4)) Minimum spanning tree has a weight of 6 with edges {A,B},{B,C},{C,D}. In the..." current
- 14:04, 21 September 2020 diff hist +23 N 8.1 Created page with " Back to Chapter 8" current
- 14:02, 21 September 2020 diff hist +2,114 N 9.33 Created page with "We avoid sums and products and throw away parts of the sample space we don't need. At the same time, we want to be efficient in our use of the space. Conceptually we create a..." current
- 14:02, 21 September 2020 diff hist +23 N 9.31 Created page with " Back to Chapter 9" current
- 14:02, 21 September 2020 diff hist +23 N 9.29 Created page with " Back to Chapter 9" current
- 14:01, 21 September 2020 diff hist +23 N 9.27 Created page with " Back to Chapter 9" current
- 14:01, 21 September 2020 diff hist +23 N 9.25 Created page with " Back to Chapter 9" current
- 14:01, 21 September 2020 diff hist +23 N 9.23 Created page with " Back to Chapter 9" current
- 14:01, 21 September 2020 diff hist +23 N 9.21 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +1 Chapter 9 →Combinatorial Optimization
- 14:00, 21 September 2020 diff hist +23 N 9.19 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +23 N 9.17 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +23 N 9.15 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +23 N 9.13 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +23 N 9.11 Created page with " Back to Chapter 9" current
- 13:52, 21 September 2020 diff hist +23 N 9.9 Created page with " Back to Chapter 9" current
- 13:52, 21 September 2020 diff hist +23 N 9.7 Created page with " Back to Chapter 9" current
- 13:52, 21 September 2020 diff hist +23 N 9.5 Created page with " Back to Chapter 9" current
- 13:51, 21 September 2020 diff hist +23 N 9.3 Created page with " Back to Chapter 9" current
- 13:51, 21 September 2020 diff hist +1,837 N 9.1 Created page with "== Algorithm == Given <code>a</code>, the input array, and <code>curr</code>, the derangement built up so far: # If <code>curr</code> represents a complete solution, print i..." current
- 13:49, 21 September 2020 diff hist +3,139 N 10.39 Created page with "== A Python Solution - O(1) == <PRE> import sys n = int(sys.argv[1]) OUT_TMP = "Min # of coins for covering %d: %d, coins used: %s" COINS = tuple(sorted((3, 4, 9, 20, 22, 23)..." current
- 13:49, 21 September 2020 diff hist +24 N 10.41 Created page with " Back to Chapter 10" current
- 13:48, 21 September 2020 diff hist +24 N 10.37 Created page with " Back to Chapter 10" current
- 13:48, 21 September 2020 diff hist +1,158 Chapter 10 →Design Problems
- 13:44, 21 September 2020 diff hist +24 N 10.35 Created page with " Back to Chapter 10" current
- 13:44, 21 September 2020 diff hist +24 N 10.33 Created page with " Back to Chapter 10" current
- 13:44, 21 September 2020 diff hist +24 N 10.31 Created page with " Back to Chapter 10" current
- 13:44, 21 September 2020 diff hist +24 N 10.29 Created page with " Back to Chapter 10" current
- 13:44, 21 September 2020 diff hist +24 N 10.27 Created page with " Back to Chapter 10" current
- 13:42, 21 September 2020 diff hist -1 Chapter 10 →Number Problems
- 13:41, 21 September 2020 diff hist 0 m 10.25 Algowikiadmin moved page 10.125 to 10.25 current