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