New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 18:09, 28 October 2020 Solution Wiki, The Algorithm Design Manual, 3rd Edition (hist) [2,007 bytes] Algowikiadmin (talk | contribs) (Created page with " The Wiki is an experiment, a grass-roots effort to create an answer key to aid self-study with the third edition of Steven Skiena's ''The Algorithm Design Manual''. Students...")
- 14:12, 21 September 2020 8.29 (hist) [238 bytes] Algowikiadmin (talk | contribs) (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...")
- 14:12, 21 September 2020 8.27 (hist) [438 bytes] Algowikiadmin (talk | contribs) (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...")
- 14:11, 21 September 2020 8.25 (hist) [561 bytes] Algowikiadmin (talk | contribs) (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...")
- 14:10, 21 September 2020 8.23 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:09, 21 September 2020 8.21 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:09, 21 September 2020 8.19 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:09, 21 September 2020 8.17 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:09, 21 September 2020 8.15 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:07, 21 September 2020 8.13 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:07, 21 September 2020 8.11 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:07, 21 September 2020 8.9 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:07, 21 September 2020 8.7 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:06, 21 September 2020 8.5 (hist) [252 bytes] Algowikiadmin (talk | contribs) (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...")
- 14:06, 21 September 2020 8.3 (hist) [252 bytes] Algowikiadmin (talk | contribs) (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...")
- 14:04, 21 September 2020 8.1 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 8")
- 14:02, 21 September 2020 9.33 (hist) [2,114 bytes] Algowikiadmin (talk | contribs) (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...")
- 14:02, 21 September 2020 9.31 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:02, 21 September 2020 9.29 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:01, 21 September 2020 9.27 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:01, 21 September 2020 9.25 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:01, 21 September 2020 9.23 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:01, 21 September 2020 9.21 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 9.19 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 9.17 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 9.15 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 9.13 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 9.11 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 13:52, 21 September 2020 9.9 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 13:52, 21 September 2020 9.7 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 13:52, 21 September 2020 9.5 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 13:51, 21 September 2020 9.3 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 9")
- 13:51, 21 September 2020 9.1 (hist) [1,837 bytes] Algowikiadmin (talk | contribs) (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...")
- 13:49, 21 September 2020 10.39 (hist) [3,139 bytes] Algowikiadmin (talk | contribs) (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)...")
- 13:49, 21 September 2020 10.41 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:48, 21 September 2020 10.37 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 10.35 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 10.33 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 10.31 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 10.29 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 10.27 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:40, 21 September 2020 10.23 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:40, 21 September 2020 10.21 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:39, 21 September 2020 10.19 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 13:39, 21 September 2020 10.17 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 01:31, 21 September 2020 10.15 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 01:17, 21 September 2020 10.11 (hist) [534 bytes] Algowikiadmin (talk | contribs) (Created page with "Answer to both a) and b) is no. Knapsack problem is NP-complete. ---- (a) Yes, this is a special case of the Knapsack problem where the value of each item is the same (desc...")
- 01:17, 21 September 2020 10.13 (hist) [2,566 bytes] Algowikiadmin (talk | contribs) (Created page with "==== 1 ==== # 20 x 1 # 1 x 6 + 14 x 1 # 2 x 6 + 8 x 1 # 3 x 6 + 2 x 1 # 1 x 10 + 10 x 1 # 1 x 10 + 1 x 6 + 4 x 1 # 2 x 10 ==== 2 ==== More generally: # there is always o...")
- 01:16, 21 September 2020 10.9 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 01:16, 21 September 2020 10.7 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
