User contributions
Jump to navigation
Jump to search
- 01:01, 21 September 2020 diff hist +23 N 7.7 Created page with " Back to Chapter 7" current
- 01:01, 21 September 2020 diff hist +1,169 N 7.5 Created page with "Graphs with max degree 2, can be bipartite (even number of edges) or tripartite (odd number of edges) ----- Consider a triangle (3 edges, 3 vertices): it's not bipartite eve..." current
- 01:00, 21 September 2020 diff hist +325 N 7.3 Created page with "Induction proof: Base case: Tree composed of just two nodes: x(root) and y. There is only one way x -> y Assuming there is an unique path between x and y, we add a new leaf..." current
- 00:59, 21 September 2020 diff hist +241 N 7.1 Created page with "(a) BFS: * Graph G1: A, B, D, I, C, E, G, J, F, H * Graph G2: A, B, E, C, F, I, D, G, J, M, H, K, N, L, O, P (b) DFS: * Graph G1: A, B, C, E, D, G, H, F, J, I * Graph G2: A,..." current
- 00:58, 21 September 2020 diff hist +23 N 6.11 Created page with " Back to Chapter 6" current
- 00:58, 21 September 2020 diff hist +23 N 6.9 Created page with " Back to Chapter 6" current
- 00:58, 21 September 2020 diff hist +23 N 6.7 Created page with " Back to Chapter 6" current
- 00:58, 21 September 2020 diff hist +23 N 6.5 Created page with " Back to Chapter 6" current
- 00:58, 21 September 2020 diff hist +23 N 6.1 Created page with " Back to Chapter 6" current
- 00:57, 21 September 2020 diff hist +1,666 N 6.3 Created page with "1) Starting from left to right, the number of inversions for 1st number is n-1 for 2nd number is n-2 ... .. ....nth number is n-n = 0 Total number of inversions is..." current
- 00:56, 21 September 2020 diff hist +23 N 5.15 Created page with " Back to Chapter 5" current
- 00:56, 21 September 2020 diff hist +23 N 5.13 Created page with " Back to Chapter 5" current
- 00:56, 21 September 2020 diff hist +23 N 5.11 Created page with " Back to Chapter 5" current
- 00:56, 21 September 2020 diff hist +23 N 5.9 Created page with " Back to Chapter 5" current
- 00:56, 21 September 2020 diff hist +729 N 5.7 Created page with "<math>O(n+m)</math> is necessary and sufficient. Lower bound comes from potentially independent values along second diagonal -- upper bound comes from observing that we can el..." current
- 00:55, 21 September 2020 diff hist +520 N 5.5 Created page with "Apply binary search to find out transition point <pre> Assume set indexes are zero based FindIndex(A): 1. low = 0, high =1 2. mid = (low + high)/2 3. if(A[mid] >..." current
- 00:54, 21 September 2020 diff hist +391 N 5.3 Created page with "(1) Do a binary search within the range of <math>1-n</math>. You guess the right number within O(log n) questions. (2) If you don't know n start with a random number <math>2^..." current
- 00:53, 21 September 2020 diff hist +888 N 5.1 Created page with "'''Part -1''' Since set is sorted the max element will lie at position <pre> Since set is sorted the max element will lie at position Max = Set[k] where k != 0 Set[n..." current
- 18:37, 20 September 2020 diff hist +1,978 4.53 current
- 18:36, 20 September 2020 diff hist +802 N 4.51 Created page with "If we are allowed to maintain a second stack on the side, this should be possible. The main stack is a regular stack that can be implemented using an array and an index to the..." current
- 18:36, 20 September 2020 diff hist 0 4.53
- 18:36, 20 September 2020 diff hist +802 N 4.53 Created page with "If we are allowed to maintain a second stack on the side, this should be possible. The main stack is a regular stack that can be implemented using an array and an index to the..."
- 18:35, 20 September 2020 diff hist +23 N 4.49 Created page with " Back to Chapter 4" current
- 18:34, 20 September 2020 diff hist +475 N 4.47 Created page with " For a known set of integer numbers ( assume Nr-1, Nr-2 ... Nr-k) the best is to use a non-comparison based sort algorithm like radix sort with O(n) You have an array that cr..." current
- 18:33, 20 September 2020 diff hist +23 N 4.45 Created page with " Back to Chapter 4" current
- 18:32, 20 September 2020 diff hist +23 N 4.43 Created page with " Back to Chapter 4" current
- 18:32, 20 September 2020 diff hist +23 N 4.41 Created page with " Back to Chapter 4" current
- 18:31, 20 September 2020 diff hist +23 N 4.39 Created page with " Back to Chapter 4" current
- 18:30, 20 September 2020 diff hist +23 N 4.37 Created page with " Back to Chapter 4" current
- 18:30, 20 September 2020 diff hist +668 N 4.35 Created page with "It's not clear to me if the first <math>n - \sqrt n</math> element being sorted means that the remaining <math>\sqrt n</math> elements are all bigger or not, but let's suppose..." current
- 18:30, 20 September 2020 diff hist +23 N 4.33 Created page with " Back to Chapter 4" current
- 18:29, 20 September 2020 diff hist +177 N 4.31 Created page with "To guarantee mergesort is stable, when merging the two subarrays together, mergesort should settle ties in the lists by choosing the lower indexed value. Back to Chapter 4" current
- 18:28, 20 September 2020 diff hist +23 N 4.29 Created page with " Back to Chapter 4" current
- 18:28, 20 September 2020 diff hist +23 N 4.27 Created page with " Back to Chapter 4" current
- 18:28, 20 September 2020 diff hist +23 N 4.25 Created page with " Back to Chapter 4" current
- 18:28, 20 September 2020 diff hist +1,721 N 4.23 Created page with "<pre> from random import choices def group_by_color(data, start, stop, color): operations_counter = 0 while start < stop and start < len(data) and stop >= 0:..." current
- 18:27, 20 September 2020 diff hist +992 N 4.21 Created page with "the general form of this problem is to find the kth largest value. finding the median is when k = n/2. to find the kth largest value, * select a partition element and split..." current
- 18:26, 20 September 2020 diff hist +900 N 4.19 Created page with "1) Finding the maximum element is O(1) in both a max-heap (the root of the heap) and a sorted array (the last element in the array), so for this operation, both data structure..." current
- 18:25, 20 September 2020 diff hist +539 N 4.17 Created page with "Scan through the array to build an out-of-order heap, that is, the first element is indeed the smallest, but necessarily any of the other elements. This takes us O(n). Then ex..." current
- 18:25, 20 September 2020 diff hist +23 N 4.15 Created page with " Back to Chapter 4" current
- 18:25, 20 September 2020 diff hist +23 N 4.13 Created page with " Back to Chapter 4" current
- 18:24, 20 September 2020 diff hist +3,256 N 4.11 Created page with "Note that there can be at most one element which appears more than n/2 (i.e. at least ceil(n/2) ) times in the list. If we now consider the *sorted* version of the list, we'l..." current
- 18:23, 20 September 2020 diff hist -19 4.9 current
- 18:23, 20 September 2020 diff hist +3,167 N 4.9 Created page with "Here the main thing to notice is that we need a O(<math>n^{k-1}logn</math>) solution. <br /> For various values of k, <br /> k Solution Time Complexity <br /> 1 O..."
- 18:22, 20 September 2020 diff hist +23 N 4.7 Created page with " Back to Chapter 4" current
- 18:21, 20 September 2020 diff hist +250 N 4.5 Created page with "O(nlogn) solution: : sort the array first, : scan the array, keep updating a max_so_far counter. O(n) solution: : put each value into hash map with the value as key and fre..." current
- 18:20, 20 September 2020 diff hist +354 N 4.3 Created page with "<pre> Algo - If we create pair of (min1, max2n) (min1, max2n-1)... will provide optimal result 1) Sort the set of 2n element (n log n) 2) Now assign two pointers Start: A[..." current
- 18:20, 20 September 2020 diff hist +3 4.1 current
- 18:20, 20 September 2020 diff hist +200 N 4.1 Created page with "Sort it with your favorite nlogn sorting algo. The bottom half is one team, the top half the other. Or much better , partition it with median as pivot . Time complexity O(n)..."
- 18:18, 20 September 2020 diff hist +3,540 N 3.45 Created page with " == Using a Hashtable == Scan the web page word by word and for each one, except the first, take the pair formed by the previous word + the current one. Use that pair as the..." current
- 18:16, 20 September 2020 diff hist +786 N 3.43 Created page with "<pre> 1) Take two pointers Fast and Slow (Slow jumps one step at a time while Fast two step) 2) While (Fast != NULL) if(Fast == Slow) return true;..." current
- 18:14, 20 September 2020 diff hist +151 N 3.41 Created page with "Create a count sort in magazine until you find all the characters of given string. --Max 06:49, 25 June 2010 (EDT) Back to Chapter 3" current
- 18:14, 20 September 2020 diff hist +2,155 N 3.39 Created page with "== Iterative version with three variables == <pre> Node* ReverseList( Node * List ) { Node *temp1 = *List; Node * temp2 = NULL; Node * temp3 = NULL; while ( temp..." current
- 18:12, 20 September 2020 diff hist +453 N 3.37 Created page with "<pre> bool compare(struct node* a, struct node* b) { // 1. both empty -> true if (a==NULL && b==NULL) return(true); // 2. both non-empty -> compare them else if (a!..." current
- 18:11, 20 September 2020 diff hist -4 Chapter 3 →Interview Problems
- 18:10, 20 September 2020 diff hist +81 N 3.35 Created page with "Sort the shirts by color and do a binary search on color. Back to Chapter 3" current
- 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
- 20:42, 19 September 2020 diff hist +1,302 Chapter 4 →Searching
- 20:37, 19 September 2020 diff hist +650 Chapter 4 →Lower Bounds
- 20:34, 19 September 2020 diff hist +2,671 Chapter 4 →Other Sorting Alogrithims
- 19:58, 19 September 2020 diff hist +1,260 Chapter 4 →Mergesort
- 19:52, 19 September 2020 diff hist +2,911 Chapter 4 →Quicksort
- 19:39, 19 September 2020 diff hist +1,157 Chapter 4 →Heaps
- 19:36, 19 September 2020 diff hist +13 Chapter 4 →Applications of Sorting: Intervals and Sets
- 19:35, 19 September 2020 diff hist +2,099 Chapter 4 →Applicatoins of Sorting: Intervals and Sets
- 18:52, 19 September 2020 diff hist +7 Chapter 4 →Applications of Sorting: Numbers
- 18:52, 19 September 2020 diff hist +2,831 Chapter 4 →Applications of Sorting: Numbers
- 18:20, 19 September 2020 diff hist +110 Chapter 2 →Big Oh
- 15:29, 18 September 2020 diff hist 0 Chapter 4 →Sorting
- 15:28, 18 September 2020 diff hist +2,829 Chapter 4 →Applications of Sorting: Numbers
- 15:10, 18 September 2020 diff hist +1 Chapter 3 →Applications of Tree Structures
- 15:09, 18 September 2020 diff hist +6,044 Chapter 3 →Applications of Tree Structures
- 14:43, 18 September 2020 diff hist +3,320 Chapter 3 →Trees and Other Dictionary Structures
- 14:27, 18 September 2020 diff hist +2 Chapter 3 →Implementation Projects
- 14:26, 18 September 2020 diff hist +878 Chapter 3 →Implementation Projects
- 20:48, 14 September 2020 diff hist +1,937 Chapter 3 →Interview Problems
- 20:42, 14 September 2020 diff hist +1,035 Chapter 3 →Elementary Data Structures
- 20:39, 14 September 2020 diff hist +7 Chapter 3 →Stacks, Queues, and Lists
- 20:38, 14 September 2020 diff hist +2,236 Chapter 3 →Stacks, Queues, and Lists
- 18:49, 14 September 2020 diff hist +1,801 Chapter 5 →Recurrence Relations
- 18:40, 14 September 2020 diff hist +1,512 Chapter 5 →Divide and Conquer Algorithms
- 18:33, 14 September 2020 diff hist +2,844 Chapter 5 →Binary Search
- 18:02, 14 September 2020 diff hist +1,452 Chapter 6 →Randomized Algorithms
- 17:57, 14 September 2020 diff hist +1,307 Chapter 6 →Hashing
- 17:53, 14 September 2020 diff hist +1,599 Chapter 6 →Propability
- 17:43, 14 September 2020 diff hist +1 Chapter 7 →Articulation Vertices
- 17:42, 14 September 2020 diff hist +180 Chapter 7 →Interview Problems
- 17:42, 14 September 2020 diff hist +1,412 Chapter 7 →Articulation Vertices
- 17:30, 14 September 2020 diff hist +4,775 Chapter 7 →Directed Graphs
- 17:13, 14 September 2020 diff hist +5,603 Chapter 7 →Algorithm Design
- 16:31, 14 September 2020 diff hist +1,803 Chapter 7 →Applications
- 16:25, 14 September 2020 diff hist +4,097 Chapter 7 →Traversal
- 16:13, 14 September 2020 diff hist -29 Chapter 7 →Simulating Graph Algorithms
- 16:13, 14 September 2020 diff hist +671 Chapter 7 →Simulating Graph Algorithms
- 15:16, 14 September 2020 diff hist +452 Chapter 8 →Network Flow and Matching
- 23:31, 13 September 2020 diff hist +5,861 Chapter 8 →Shortest Paths
- 23:04, 13 September 2020 diff hist +536 Chapter 8 →Union Find
- 23:01, 13 September 2020 diff hist +1,242 Chapter 8 →Minimum Spanning Tree
- 22:43, 13 September 2020 diff hist +3,015 Chapter 8 →Minimum Spanning Tree
- 22:31, 13 September 2020 diff hist +17 Chapter 8 →Simulating Graph Algorithms
- 22:31, 13 September 2020 diff hist +355 Chapter 8 →Simulating Graph Algorithms
- 22:00, 13 September 2020 diff hist 0 Chapter 8 →Weighted Graph Algorithms
- 21:59, 13 September 2020 diff hist +1,177 Chapter 9 →Interview Problems
- 21:40, 13 September 2020 diff hist +1,046 Chapter 9 →Combinatorial Optimization
- 21:37, 13 September 2020 diff hist +13 Chapter 10 →Number Problems
- 21:37, 13 September 2020 diff hist +1 Chapter 9 →Permutations
- 21:36, 13 September 2020 diff hist +1,743 Chapter 9 →Games and Puzzles
- 21:26, 13 September 2020 diff hist +3,577 Chapter 9 →Backtracking
- 21:08, 13 September 2020 diff hist +1,967 Chapter 9 →Permutations
- 20:48, 13 September 2020 diff hist +19 Chapter 10 →Interview Problems
- 20:48, 13 September 2020 diff hist +776 Chapter 10 →Interview Problems
- 20:45, 13 September 2020 diff hist -2 Chapter 10 →Edit Distance
- 20:44, 13 September 2020 diff hist 0 Chapter 10 →Design Problems
- 20:44, 13 September 2020 diff hist 0 Chapter 10 →Design Problems
- 20:43, 13 September 2020 diff hist 0 Chapter 10 →Design Problems
- 20:43, 13 September 2020 diff hist +5,446 Chapter 10 →Design Problems
- 20:26, 13 September 2020 diff hist +2,286 Chapter 10 →Graphing Problem
- 20:18, 13 September 2020 diff hist +4,340 Chapter 10 →Number Problems
- 19:54, 13 September 2020 diff hist +2,843 Chapter 10 →Greedy Algorithms
- 19:44, 13 September 2020 diff hist +2,131 Chapter 10 →Number Problems
- 19:28, 13 September 2020 diff hist -2 Chapter 10 →Edit Distance
- 19:25, 13 September 2020 diff hist +3,230 Chapter 10 →Edit Distance
- 00:07, 13 September 2020 diff hist +18 Chapter 10 →Elementary Recurrences
- 22:23, 11 September 2020 diff hist -1 Chapter 10 →Elementary Recurrences
- 22:22, 11 September 2020 diff hist 0 Chapter 10 →Elementary Recurrences
- 22:21, 11 September 2020 diff hist +2 Chapter 10 →Dynamic Programming
- 22:17, 11 September 2020 diff hist +1,946 Chapter 10 →Elementary Recurrences
- 22:09, 11 September 2020 diff hist +24 N 11.35 Created page with " Back to Chapter 11" current
- 22:08, 11 September 2020 diff hist 0 Chapter 11 →Algorithms for Special Cases
- 22:07, 11 September 2020 diff hist +24 N 11.33 Created page with " Back to Chapter 11" current
- 22:06, 11 September 2020 diff hist +24 N 11.31 Created page with " Back to Chapter 11" current
- 22:06, 11 September 2020 diff hist +24 N 11.29 Created page with " Back to Chapter 11" current
- 22:06, 11 September 2020 diff hist +24 N 11.27 Created page with " Back to Chapter 11" current
- 19:23, 11 September 2020 diff hist +24 N 11.25 Created page with " Back to Chapter 11" current
- 19:22, 11 September 2020 diff hist +24 N 11.23 Created page with " Back to Chapter 11" current
- 19:21, 11 September 2020 diff hist +24 N 11.21 Created page with " Back to Chapter 11" current
- 19:18, 11 September 2020 diff hist +24 N 11.13 Created page with " Back to Chapter 11" current
- 19:18, 11 September 2020 diff hist +24 N 11.19 Created page with " Back to Chapter 11" current
- 19:18, 11 September 2020 diff hist +24 N 11.17 Created page with " Back to Chapter 11" current
- 19:16, 11 September 2020 diff hist +24 N 11.15 Created page with " Back to Chapter 11" current
- 19:13, 11 September 2020 diff hist +19 Chapter 11 →Basic Reductions
- 19:12, 11 September 2020 diff hist +2,093 Chapter 11 →Algorithms for Special Cases
- 19:00, 11 September 2020 diff hist +3,299 Chapter 11 →Creatvie Reductions
- 18:55, 11 September 2020 diff hist +3,301 Chapter 11 →Basic Reductions
- 21:45, 10 September 2020 diff hist +24 N 11.11 Created page with " Back to Chapter 11" current
- 21:41, 10 September 2020 diff hist +2,305 Chapter 11 →Basic Reductions
- 21:35, 10 September 2020 diff hist +24 N 11.9 Created page with " Back to Chapter 11" current
- 21:35, 10 September 2020 diff hist +24 N 11.7 Created page with " Back to Chapter 11" current
- 21:35, 10 September 2020 diff hist +24 N 11.5 Created page with " Back to Chapter 11" current
- 21:34, 10 September 2020 diff hist +24 N 11.3 Created page with " Back to Chapter 11" current
- 21:34, 10 September 2020 diff hist 0 11.1 current
- 21:34, 10 September 2020 diff hist +24 N 11.1 Created page with " Back to Chapter 12"
- 21:32, 10 September 2020 diff hist +2,038 Chapter 11 →Transformations and Satisfiability
- 21:11, 10 September 2020 diff hist -1 Chapter 12
- 21:11, 10 September 2020 diff hist +24 N 12.19 Created page with " Back to Chapter 12" current
- 21:11, 10 September 2020 diff hist +24 N 12.21 Created page with " Back to Chapter 12" current
- 21:11, 10 September 2020 diff hist +24 N 12.17 Created page with " Back to Chapter 12" current
- 21:11, 10 September 2020 diff hist +24 N 12.15 Created page with " Back to Chapter 12" current
- 21:10, 10 September 2020 diff hist +24 N 12.13 Created page with " Back to Chapter 12" current
- 21:10, 10 September 2020 diff hist +1 Chapter 12 →Combinatorial Optimization
- 21:09, 10 September 2020 diff hist +24 N 12.11 Created page with " Back to Chapter 12" current
- 21:09, 10 September 2020 diff hist +24 N 12.9 Created page with " Back to Chapter 12" current
- 21:09, 10 September 2020 diff hist +24 N 12.7 Created page with " Back to Chapter 12" current
- 21:08, 10 September 2020 diff hist +24 N 12.5 Created page with " Back to Chapter 12" current
- 21:08, 10 September 2020 diff hist +24 N 12.3 Created page with " Back to Chapter 12" current
- 21:08, 10 September 2020 diff hist +24 N 12.1 Created page with " Back to Chapter 12" current
- 21:03, 10 September 2020 diff hist +1,077 Chapter 12 →"Quantum" Computing
- 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
- 18:29, 7 September 2020 diff hist +602 Chapter 7
- 18:20, 7 September 2020 diff hist +201 Chapter 6
- 18:16, 7 September 2020 diff hist +1 Chapter 5 →Recurrence Relations
- 18:16, 7 September 2020 diff hist +247 Chapter 5
- 18:11, 7 September 2020 diff hist +2 Chapter 4 →Applications of Sorting: Numbers
- 18:11, 7 September 2020 diff hist -3 Chapter 4 →Applications of Sorting: Numbers
- 18:10, 7 September 2020 diff hist 0 Chapter 4 →Searching
- 18:10, 7 September 2020 diff hist +1 Chapter 4 →Mergesort=
- 18:10, 7 September 2020 diff hist +787 Chapter 4
- 17:38, 7 September 2020 diff hist +11 Chapter 3 →Interview Problems
- 17:38, 7 September 2020 diff hist +1 Chapter 3 →Implementation Projects
- 17:38, 7 September 2020 diff hist +9 Chapter 3 →Applications of Tree Structures
- 17:37, 7 September 2020 diff hist +2 Chapter 3 →Elementray Data Structures
- 17:37, 7 September 2020 diff hist +6 Chapter 3 →Stacks, Queues, and Lists