All public logs
Jump to navigation
Jump to search
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)- 18:32, 20 September 2020 Algowikiadmin talk contribs created page 4.41 (Created page with " Back to Chapter 4")
- 18:31, 20 September 2020 Algowikiadmin talk contribs created page 4.39 (Created page with " Back to Chapter 4")
- 18:30, 20 September 2020 Algowikiadmin talk contribs created page 4.37 (Created page with " Back to Chapter 4")
- 18:30, 20 September 2020 Algowikiadmin talk contribs created page 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...")
- 18:30, 20 September 2020 Algowikiadmin talk contribs created page 4.33 (Created page with " Back to Chapter 4")
- 18:29, 20 September 2020 Algowikiadmin talk contribs created page 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")
- 18:28, 20 September 2020 Algowikiadmin talk contribs created page 4.29 (Created page with " Back to Chapter 4")
- 18:28, 20 September 2020 Algowikiadmin talk contribs created page 4.27 (Created page with " Back to Chapter 4")
- 18:28, 20 September 2020 Algowikiadmin talk contribs created page 4.25 (Created page with " Back to Chapter 4")
- 18:28, 20 September 2020 Algowikiadmin talk contribs created page 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:...")
- 18:27, 20 September 2020 Algowikiadmin talk contribs created page 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...")
- 18:26, 20 September 2020 Algowikiadmin talk contribs created page 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...")
- 18:25, 20 September 2020 Algowikiadmin talk contribs created page 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...")
- 18:25, 20 September 2020 Algowikiadmin talk contribs created page 4.15 (Created page with " Back to Chapter 4")
- 18:25, 20 September 2020 Algowikiadmin talk contribs created page 4.13 (Created page with " Back to Chapter 4")
- 18:24, 20 September 2020 Algowikiadmin talk contribs created page 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...")
- 18:23, 20 September 2020 Algowikiadmin talk contribs created page 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 Algowikiadmin talk contribs created page 4.7 (Created page with " Back to Chapter 4")
- 18:21, 20 September 2020 Algowikiadmin talk contribs created page 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...")
- 18:20, 20 September 2020 Algowikiadmin talk contribs created page 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[...")
