New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 19:16, 11 September 2020 11.15 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 21:45, 10 September 2020 11.11 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 21:35, 10 September 2020 11.9 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 21:35, 10 September 2020 11.7 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 21:35, 10 September 2020 11.5 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 21:34, 10 September 2020 11.3 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 21:34, 10 September 2020 11.1 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:11, 10 September 2020 12.19 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:11, 10 September 2020 12.21 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:11, 10 September 2020 12.17 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:11, 10 September 2020 12.15 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:10, 10 September 2020 12.13 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:09, 10 September 2020 12.11 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:09, 10 September 2020 12.9 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:09, 10 September 2020 12.7 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:08, 10 September 2020 12.5 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:08, 10 September 2020 12.3 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 21:08, 10 September 2020 12.1 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 12")
- 20:01, 10 September 2020 2.21 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 20:00, 10 September 2020 2.19 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 20:00, 10 September 2020 2.25 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:59, 10 September 2020 2.23 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:59, 10 September 2020 2.27 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:58, 10 September 2020 2.29 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:57, 10 September 2020 2.31 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:57, 10 September 2020 2.33 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:56, 10 September 2020 2.35 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:55, 10 September 2020 2.37 (hist) [704 bytes] Algowikiadmin (talk | contribs) (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 2.39 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:53, 10 September 2020 2.41 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:51, 10 September 2020 2.43 (hist) [472 bytes] Algowikiadmin (talk | contribs) (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...")
- 19:51, 10 September 2020 2.45 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:45, 10 September 2020 2.47 (hist) [531 bytes] Algowikiadmin (talk | contribs) (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 2.49 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:43, 10 September 2020 2.51 (hist) [519 bytes] Algowikiadmin (talk | contribs) (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...")
- 19:43, 10 September 2020 2.53 (hist) [3,485 bytes] Algowikiadmin (talk | contribs) (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...")
- 19:41, 10 September 2020 2.55 (hist) [2,899 bytes] Algowikiadmin (talk | contribs) (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...")
- 19:41, 10 September 2020 2.17 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:40, 10 September 2020 2.15 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 19:39, 10 September 2020 2.13 (hist) [190 bytes] Algowikiadmin (talk | contribs) (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...")
- 19:38, 10 September 2020 2.11 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 18:53, 9 September 2020 2.9 (hist) [3,169 bytes] Algowikiadmin (talk | contribs) (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:51, 9 September 2020 2.7 (hist) [520 bytes] Algowikiadmin (talk | contribs) (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 2.5 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 2")
- 18:49, 9 September 2020 2.3 (hist) [1,620 bytes] Algowikiadmin (talk | contribs) (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...")
- 19:25, 8 September 2020 2.1 (hist) [3,063 bytes] Algowikiadmin (talk | contribs) (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...")
- 12:25, 1 September 2020 1.37 (hist) [814 bytes] Algowikiadmin (talk | contribs) (Created page with "I'm envisioning the United States as a rectangle 1000 miles high and 3000 miles long. I'm not including Alaska, because, although it's large, it doesn't have many roads. Much...")
- 12:25, 1 September 2020 1.35 (hist) [806 bytes] Algowikiadmin (talk | contribs) (Created page with "'''Assumptions''': : approx 400000 cars : each car needs to refuel once a week : each gas station is open 10 hours a day and refuels 10 cars an hour : there are enough station...")
- 12:23, 1 September 2020 1.33 (hist) [7,978 bytes] Algowikiadmin (talk | contribs) (Created page with " Answer: Seven races. '''First 5 races:''' Divide 25 horses into 5 groups and that gives you 5 winners. '''Sixth race:''' Now race 5 of them that will give you winner and wh...")
- 12:21, 1 September 2020 1.31 (hist) [22 bytes] Algowikiadmin (talk | contribs) (Created page with "Back to Chapter 1.")
