User contributions
Jump to navigation
Jump to search
- 20:57, 10 September 2020 diff hist +980 Chapter 12 →Combinatorial Optimization
- 20:45, 10 September 2020 diff hist +2,583 Chapter 12 →Approximation Algorithms
- 20:30, 10 September 2020 diff hist +1,996 Chapter 12 →Special Cases of Hard Problems
- 20:17, 10 September 2020 diff hist -38 Chapter 1
- 20:14, 10 September 2020 diff hist +481 Chapter 2 →Big Oh
- 20:02, 10 September 2020 diff hist 0 Chapter 2 →Program Analysis
- 20:01, 10 September 2020 diff hist +23 N 2.21 Created page with " Back to Chapter 2" current
- 20:00, 10 September 2020 diff hist +23 N 2.19 Created page with " Back to Chapter 2" current
- 20:00, 10 September 2020 diff hist +23 N 2.25 Created page with " Back to Chapter 2" current
- 19:59, 10 September 2020 diff hist +23 N 2.23 Created page with " Back to Chapter 2" current
- 19:59, 10 September 2020 diff hist +23 N 2.27 Created page with " Back to Chapter 2" current
- 19:58, 10 September 2020 diff hist +23 N 2.29 Created page with " Back to Chapter 2" current
- 19:57, 10 September 2020 diff hist +23 N 2.31 Created page with " Back to Chapter 2" current
- 19:57, 10 September 2020 diff hist +23 N 2.33 Created page with " Back to Chapter 2" current
- 19:56, 10 September 2020 diff hist +23 N 2.35 Created page with " Back to Chapter 2" current
- 19:55, 10 September 2020 diff hist +3 2.37 current
- 19:55, 10 September 2020 diff hist +701 N 2.37 Created page with "On careful observation , one can see that the sum of any row is just <math>3^{n-1}</math> this is the sum for the series . This can even be computed using a series as shown b..."
- 19:54, 10 September 2020 diff hist +23 N 2.39 Created page with " Back to Chapter 2" current
- 19:53, 10 September 2020 diff hist +23 N 2.41 Created page with " Back to Chapter 2" current
- 19:51, 10 September 2020 diff hist +472 N 2.43 Created page with "X=n-digit number (abcdefghijklmn), y= n-digit number (ABCDEFGHIJKLMN) say X * y = X * N + X * M0 + X * L00 + X * K000 + .... + X * B000000000000 + X * A0000000000000 With ea..." current
- 19:51, 10 September 2020 diff hist +23 N 2.45 Created page with " Back to Chapter 2" current
- 19:50, 10 September 2020 diff hist +4 2.47 current
- 19:49, 10 September 2020 diff hist +4 2.47
- 19:45, 10 September 2020 diff hist +523 N 2.47 Created page with "Change the assumptions of the proof. The paper mentioned is "S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28:775-784, 1988." '''Other solution :''' <m..."
- 19:44, 10 September 2020 diff hist +23 N 2.49 Created page with " Back to Chapter 2" current
- 19:43, 10 September 2020 diff hist +519 N 2.51 Created page with "<pre> 1) Find an empty bag (labeled "E") 2) Place 1 coin from bag 1 into E 3) Place 2 coins from bag 2 into E ... 10) Place 9 coins from bag 9 into E 11) Place 10 coins from b..." current
- 19:43, 10 September 2020 diff hist +3,485 N 2.53 Created page with "Some incorrect answers were reached. These have been moved to the discussion, with explanation of where the argument goes wrong. The correct answer: Assuming pairwise merges..." current
- 19:41, 10 September 2020 diff hist +2,899 N 2.55 Created page with "This problem is a famous game-theoretical scenario called the pirate game (http://en.wikipedia.org/wiki/Pirate_game). Assume the senior pirate gets to vote. Where there is on..." current
- 19:41, 10 September 2020 diff hist +23 N 2.17 Created page with " Back to Chapter 2" current
- 19:40, 10 September 2020 diff hist +23 N 2.15 Created page with " Back to Chapter 2" current
- 19:39, 10 September 2020 diff hist +190 N 2.13 Created page with "because <math> n^2 <= 2^n </math> for every n greater than 4 . Hence, we can say that <math> n^2 < = C* 2^n </math> for every n>=4 and so <math> n^2 = O(2^n)</math>. Back t..." current
- 19:38, 10 September 2020 diff hist +23 N 2.11 Created page with " Back to Chapter 2" current
- 19:34, 10 September 2020 diff hist -8 Chapter 2 →Big Oh
- 19:29, 10 September 2020 diff hist +8 Chapter 2 →Big Oh
- 21:54, 9 September 2020 diff hist +7 Chapter 2 →Big Oh
- 19:00, 9 September 2020 diff hist -6 2.9 →2-8. current
- 18:58, 9 September 2020 diff hist +211 Chapter 2 →Big Oh
- 18:53, 9 September 2020 diff hist +3,175 N 2.9 Created page with "=2-8.= For each of the following pairs of functions, either <math>f(n)</math> is in <math>O(g(n))</math>, <math>f(n)</math> is in <math>\Omega(g(n))</math>, or <math>f(n)=\Th..."
- 18:52, 9 September 2020 diff hist +1 2.7 current
- 18:51, 9 September 2020 diff hist +519 N 2.7 Created page with "'''n = 1''' The single element array is already its max. Loop is not entered. Max is returned Let for '''n=k''', the algorithm is true For '''n = k+1''' ,two cases arise :..."
- 18:50, 9 September 2020 diff hist +24 N 2.5 Created page with " Back to Chapter 2" current
- 18:49, 9 September 2020 diff hist +1,620 N 2.3 Created page with "<math>f(n) = (((n^2)(n+1)^2)/8) + n(n+1)(2n+1)/12</math> ---- This problem does appear to break down into a series of nested summations: <math> \displaystyle\sum_{i=1}^{n}\te..." current
- 19:25, 8 September 2020 diff hist +3,063 N 2.1 Created page with " This loop can be expressed as the sum: <math> \sum_{i=1}^{n-1}\sum_{j=i+1}^{n}\sum_{k=1}^{j}1 </math> Reducing this, sum by sum from the rhs: <math> \begin{align} &\sum_{i..." current
- 19:48, 7 September 2020 diff hist +385 Chapter 12
- 19:45, 7 September 2020 diff hist +515 Chapter 11
- 19:33, 7 September 2020 diff hist +630 Chapter 10
- 19:18, 7 September 2020 diff hist +482 Chapter 9
- 18:57, 7 September 2020 diff hist +438 Chapter 8
- 18:30, 7 September 2020 diff hist +2 Chapter 7 →Traversal
- 18:30, 7 September 2020 diff hist +1 Chapter 7 →=Traversal
