User contributions
Jump to navigation
Jump to search
- 18:09, 20 September 2020 diff hist +23 N 3.33 Created page with " Back to Chapter 3" current
- 18:08, 20 September 2020 diff hist +285 N 3.31 Created page with "Init: k=0 Insert X: k = k+1; A[X] = k; B[k] = X; Search X: return (A[X] < k) and (B[A[X]] == X) Delete X: A[B[k]] = A[X]; B[A[X]] = B[k]; k = k-1; Ple..." current
- 18:08, 20 September 2020 diff hist +1,323 N 3.29 Created page with "In each node of a binary tree store the sub tree sum for the left sub tree. #''Add'': while descending the tree to the left update the sub tree sum by adding the value #''Ins..." current
- 18:06, 20 September 2020 diff hist +417 N 3.27 Created page with "Let's put into the black box whole set <math>S=\{x_i\}_{i=1}^n</math>. If <math>bb(S)</math> is True, then such a subset exists and we can go on: # R:=S # for i:=1 to n do ##..." current
- 18:06, 20 September 2020 diff hist +23 N 3.25 Created page with " Back to Chapter 3" current
- 18:05, 20 September 2020 diff hist +23 N 3.23 Created page with " Back to Chapter 3" current
- 18:05, 20 September 2020 diff hist +657 N 3.21 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..." current
- 18:04, 20 September 2020 diff hist +444 N 3.19 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..." current
- 18:03, 20 September 2020 diff hist +23 N 3.17 Created page with " Back to Chapter 3" current
- 18:03, 20 September 2020 diff hist +23 N 3.15 Created page with " Back to Chapter 3" current
- 18:02, 20 September 2020 diff hist +23 N 3.13 Created page with " Back to Chapter 3" current
- 18:02, 20 September 2020 diff hist +205 N 3.11 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..." current
- 18:00, 20 September 2020 diff hist +23 N 3.9 Created page with " Back to Chapter 3" current
- 17:59, 20 September 2020 diff hist +23 N 3.7 Created page with " Back to Chapter 3" current
- 17:59, 20 September 2020 diff hist 0 3.5 current
- 17:59, 20 September 2020 diff hist +173 N 3.5 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 diff hist +4,259 N 3.3 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)) {..." current
- 17:56, 20 September 2020 diff hist +3,596 N 3.1 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;..." current
- 20:48, 19 September 2020 diff hist +1,166 Chapter 4 →Interview Problems
- 20:44, 19 September 2020 diff hist +1,679 Chapter 4 →Implementaion Challenges