New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 100 | older 100) (20 | 50 | 100 | 250 | 500)
- 18:05, 20 September 2020 3.21 (hist) [657 bytes] Algowikiadmin (talk | contribs) (Created page with "Since all the elements in S2 have keys larger than the keys of the elements in S1, those two trees can be subtrees of one tree whose root node will have a key larger than the...")
- 18:04, 20 September 2020 3.19 (hist) [444 bytes] Algowikiadmin (talk | contribs) (Created page with "Store two values, the maximum and minimum. These need to be checked and potentially updated on every delete. If the minimum is being deleted, call the successor, update the...")
- 18:03, 20 September 2020 3.17 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:03, 20 September 2020 3.15 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:02, 20 September 2020 3.13 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:02, 20 September 2020 3.11 (hist) [205 bytes] Algowikiadmin (talk | contribs) (Created page with "Since 1,2,...,n is finite, use a bit array to represent them.<br> See the telephone number sorting example in Column 1 of <Programming Pearls> (Jon Bentley) for detailed expla...")
- 18:00, 20 September 2020 3.9 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 17:59, 20 September 2020 3.7 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 17:59, 20 September 2020 3.5 (hist) [173 bytes] Algowikiadmin (talk | contribs) (Created page with "1. size 4 array with 3 elements. remove 1, insert 1, and so forth. <br> 2. when the array is one-fourth full, shrink its size to half of what it was. Back to Chaprer 3")
- 17:57, 20 September 2020 3.3 (hist) [4,259 bytes] Algowikiadmin (talk | contribs) (Created page with "'''C''' <pre> typedef struct Node { char *value; struct Node *next; } Node; int reverse(Node **head) { Node *curr, *prev, *next; if (!head || !(*head)) {...")
- 17:56, 20 September 2020 3.1 (hist) [3,596 bytes] Algowikiadmin (talk | contribs) (Created page with "You just need to maintain a count, like so: <pre> public static boolean isBalanced(String str) { int count = 0; for (int i = 0, n = str.length(); i < n;...")
- 22:09, 11 September 2020 11.35 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 22:07, 11 September 2020 11.33 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 22:06, 11 September 2020 11.31 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 22:06, 11 September 2020 11.29 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 22:06, 11 September 2020 11.27 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:23, 11 September 2020 11.25 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:22, 11 September 2020 11.23 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:21, 11 September 2020 11.21 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:18, 11 September 2020 11.13 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:18, 11 September 2020 11.19 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:18, 11 September 2020 11.17 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 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.")
- 12:20, 1 September 2020 1.19 (hist) [651 bytes] Algowikiadmin (talk | contribs) (Created page with "<b>Step 1:</b> Show that the statement holds for the basis case <math>n = 1</math><br> :<math>E(n) = n - 1</math><br> :<math>E(1) = 1 - 1 = 0</math>. A tree with one node has...")
- 12:19, 1 September 2020 1.17 (hist) [969 bytes] Algowikiadmin (talk | contribs) (Created page with "<b>Step 1:</b> Show that the statement holds for the basis case <math>n = 1</math><br> :<math>\frac {1}{i(i+1)} = \frac {n}{n+1}</math><br><br> :<math>\frac {1}{1(1+1)} = \fr...")
- 12:18, 1 September 2020 1.15 (hist) [1,542 bytes] Algowikiadmin (talk | contribs) (Created page with "Call the statement <math>S_n</math> and the general term <math>a_n</math><br> <b>Step 1:</b> Show that the statement holds for the basis case <math>n = 0</math><br> :<math>a...")
- 12:18, 1 September 2020 1.13 (hist) [1,013 bytes] Algowikiadmin (talk | contribs) (Created page with "The basis case is when <math>n = 0</math><br> :<math>\sum_{i=1}^0 i^2 = 0^2 = 0 </math><br> and using <math>n=0</math> in the formula <math>\frac {n(n + 1)(2 \cdot n + 1)} {6}...")
- 12:15, 1 September 2020 1.27 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with "Return to Chapter 1.")
- 12:07, 1 September 2020 1.29 (hist) [313 bytes] Algowikiadmin (talk | contribs) (Created page with "1. If there are 10 times as many items, and it is proportional to <math>n^2</math>, it will take <math>10^2</math> times as long or 100 seconds. 2. If it proportional to <math...")
- 12:06, 1 September 2020 1.25 (hist) [481 bytes] Algowikiadmin (talk | contribs) (Created page with "I estimate the mouth of the Mississippi at 1 mile wide and 100 feet, or 0.02 miles, deep. If the water were moving at 10 miles an hour, that means that 10 miles x 0.02 miles x...")
- 12:04, 1 September 2020 1.23 (hist) [637 bytes] Algowikiadmin (talk | contribs) (Created page with "1 million seconds = 277.777778 hours 1 million seconds = 11.5740741 days ---- Possible approach: a) There are 3600s in an hour b) Eliminating the thousands, we get 1000...")
- 12:03, 1 September 2020 1.21 (hist) [22 bytes] Algowikiadmin (talk | contribs) (Created page with "Back to Chapter 1.")
- 12:02, 1 September 2020 1.11 (hist) [22 bytes] Algowikiadmin (talk | contribs) (Created page with "Back to Chapter 1.")
- 12:01, 1 September 2020 1.9 (hist) [22 bytes] Algowikiadmin (talk | contribs) (Created blank page)
- 20:11, 31 August 2020 1.7 (hist) [74 bytes] Algowikiadmin (talk | contribs) (Created page with "Please add proposed solutions to the question here.")
- 20:10, 31 August 2020 1.5 (hist) [1,322 bytes] Algowikiadmin (talk | contribs) (Created page with "<p>First-fit algorithm counterexample:</p> <p> <math>S = \{1, 2, 3\}</math> <br/> <math>T = 5</math> </p> <p>Best-fit algorithm counterexample:</p> <p> <math>S = \{1, 2, 3\}<...")
- 20:09, 31 August 2020 1.3 (hist) [1,611 bytes] Algowikiadmin (talk | contribs) (Created page with " a ----------- c ----------- b \ / \--------- d ---------- / If the distance from ''a'' to ''b'' going through ''d'' is less than the dista...")
- 20:35, 23 August 2020 1.1 (hist) [307 bytes] Algowikiadmin (talk | contribs) (Created page with "''a'' + ''b'' < min(''a,b'') <-> ''a'' < 0 /\ ''b'' < 0 ---- If both ''a'' and ''b'' are negative, ''a'' + ''b''< min(''a, b''). For example ''a'' = -5 ''b'' =...")
- 19:36, 23 August 2020 Chapter 12 (hist) [7,056 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:36, 23 August 2020 Chapter 11 (hist) [13,605 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:35, 23 August 2020 Chapter 10 (hist) [24,860 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:35, 23 August 2020 Chapter 9 (hist) [10,029 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:35, 23 August 2020 Chapter 8 (hist) [11,970 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:35, 23 August 2020 Chapter 7 (hist) [19,154 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:35, 23 August 2020 Chapter 6 (hist) [4,594 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:34, 23 August 2020 Chapter 5 (hist) [6,440 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:34, 23 August 2020 Chapter 4 (hist) [21,397 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 19:33, 23 August 2020 Chapter 3 (hist) [16,102 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems Back to Chapter List")
- 18:49, 23 August 2020 Chapter 2 (hist) [18,662 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems *2.1 *2.2 *2.3 *2.4 *2.5 *2.6 *2.7 *2.8 *2.9 *2.10 *2.11 *2.12 *2.13 *2.14 *2.15 *2.16 *2.17 *2.18 *2.19 *2.20 *2.21 *2.22 *2.23 *...")
- 18:42, 23 August 2020 Chapter 1 (hist) [8,733 bytes] Algowikiadmin (talk | contribs) (Created page with "Problems *1.1 *1.2 *1.3 *1.4 *1.5 *1.6 *1.7 *1.8 *1.9 *1.10 *1.11 *1.12 *1.13 *1.14 *1.15 *1.16...")
- 18:38, 23 August 2020 Chapter List (hist) [441 bytes] Algowikiadmin (talk | contribs) (Created page with "Chapters *Chapter 1 *Chapter 2 *Chapter 3 *Chapter 4 *Chapter 5 *Chapter 6 *Chapter 7 *Chapter 8 *Chapter 9 *Chapter 10 *C...") originally created as "Problem Solutions"