New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)
- 01:02, 21 September 2020 7.9 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:01, 21 September 2020 7.7 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:01, 21 September 2020 7.5 (hist) [1,169 bytes] Algowikiadmin (talk | contribs) (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...")
- 01:00, 21 September 2020 7.3 (hist) [325 bytes] Algowikiadmin (talk | contribs) (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...")
- 00:59, 21 September 2020 7.1 (hist) [241 bytes] Algowikiadmin (talk | contribs) (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,...")
- 00:58, 21 September 2020 6.11 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 6")
- 00:58, 21 September 2020 6.9 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 6")
- 00:58, 21 September 2020 6.7 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 6")
- 00:58, 21 September 2020 6.5 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 6")
- 00:58, 21 September 2020 6.1 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 6")
- 00:57, 21 September 2020 6.3 (hist) [1,666 bytes] Algowikiadmin (talk | contribs) (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...")
- 00:56, 21 September 2020 5.15 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 5")
- 00:56, 21 September 2020 5.13 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 5")
- 00:56, 21 September 2020 5.11 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 5")
- 00:56, 21 September 2020 5.9 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 5")
- 00:56, 21 September 2020 5.7 (hist) [729 bytes] Algowikiadmin (talk | contribs) (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...")
- 00:55, 21 September 2020 5.5 (hist) [520 bytes] Algowikiadmin (talk | contribs) (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] >...")
- 00:54, 21 September 2020 5.3 (hist) [391 bytes] Algowikiadmin (talk | contribs) (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^...")
- 00:53, 21 September 2020 5.1 (hist) [888 bytes] Algowikiadmin (talk | contribs) (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...")
- 18:36, 20 September 2020 4.51 (hist) [802 bytes] Algowikiadmin (talk | contribs) (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...")