All public logs

Combined display of all available logs of The Algorithm Design Manual Solution Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)

• 00:59, 21 September 2020 Algowikiadmin talk contribs created page 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,...")
• 00:58, 21 September 2020 Algowikiadmin talk contribs created page 6.11 (Created page with " Back to Chapter 6")
• 00:58, 21 September 2020 Algowikiadmin talk contribs created page 6.9 (Created page with " Back to Chapter 6")
• 00:58, 21 September 2020 Algowikiadmin talk contribs created page 6.7 (Created page with " Back to Chapter 6")
• 00:58, 21 September 2020 Algowikiadmin talk contribs created page 6.5 (Created page with " Back to Chapter 6")
• 00:58, 21 September 2020 Algowikiadmin talk contribs created page 6.1 (Created page with " Back to Chapter 6")
• 00:57, 21 September 2020 Algowikiadmin talk contribs created page 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...")
• 00:56, 21 September 2020 Algowikiadmin talk contribs created page 5.15 (Created page with " Back to Chapter 5")
• 00:56, 21 September 2020 Algowikiadmin talk contribs created page 5.13 (Created page with " Back to Chapter 5")
• 00:56, 21 September 2020 Algowikiadmin talk contribs created page 5.11 (Created page with " Back to Chapter 5")
• 00:56, 21 September 2020 Algowikiadmin talk contribs created page 5.9 (Created page with " Back to Chapter 5")
• 00:56, 21 September 2020 Algowikiadmin talk contribs created page 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...")
• 00:55, 21 September 2020 Algowikiadmin talk contribs created page 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] >...")
• 00:54, 21 September 2020 Algowikiadmin talk contribs created page 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^...")
• 00:53, 21 September 2020 Algowikiadmin talk contribs created page 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...")
• 18:36, 20 September 2020 Algowikiadmin talk contribs created page 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...")
• 18:36, 20 September 2020 Algowikiadmin talk contribs created page 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 Algowikiadmin talk contribs created page 4.49 (Created page with " Back to Chapter 4")
• 18:34, 20 September 2020 Algowikiadmin talk contribs created page 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...")
• 18:33, 20 September 2020 Algowikiadmin talk contribs created page 4.45 (Created page with " Back to Chapter 4")

(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)