New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 18:29, 20 September 2020 4.31 (hist) [177 bytes] Algowikiadmin (talk | contribs) (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 4.29 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 4")
- 18:28, 20 September 2020 4.27 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 4")
- 18:28, 20 September 2020 4.25 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 4")
- 18:28, 20 September 2020 4.23 (hist) [1,721 bytes] Algowikiadmin (talk | contribs) (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 4.21 (hist) [992 bytes] Algowikiadmin (talk | contribs) (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 4.19 (hist) [900 bytes] Algowikiadmin (talk | contribs) (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 4.17 (hist) [539 bytes] Algowikiadmin (talk | contribs) (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 4.15 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 4")
- 18:25, 20 September 2020 4.13 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 4")
- 18:24, 20 September 2020 4.11 (hist) [3,256 bytes] Algowikiadmin (talk | contribs) (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 4.9 (hist) [3,148 bytes] Algowikiadmin (talk | contribs) (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 4.7 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 4")
- 18:21, 20 September 2020 4.5 (hist) [250 bytes] Algowikiadmin (talk | contribs) (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 4.3 (hist) [354 bytes] Algowikiadmin (talk | contribs) (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[...")
- 18:20, 20 September 2020 4.1 (hist) [203 bytes] Algowikiadmin (talk | contribs) (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 3.45 (hist) [3,540 bytes] Algowikiadmin (talk | contribs) (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...")
- 18:16, 20 September 2020 3.43 (hist) [786 bytes] Algowikiadmin (talk | contribs) (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;...")
- 18:14, 20 September 2020 3.41 (hist) [151 bytes] Algowikiadmin (talk | contribs) (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")
- 18:14, 20 September 2020 3.39 (hist) [2,155 bytes] Algowikiadmin (talk | contribs) (Created page with "== Iterative version with three variables == <pre> Node* ReverseList( Node * List ) { Node *temp1 = *List; Node * temp2 = NULL; Node * temp3 = NULL; while ( temp...")
- 18:12, 20 September 2020 3.37 (hist) [453 bytes] Algowikiadmin (talk | contribs) (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!...")
- 18:10, 20 September 2020 3.35 (hist) [81 bytes] Algowikiadmin (talk | contribs) (Created page with "Sort the shirts by color and do a binary search on color. Back to Chapter 3")
- 18:09, 20 September 2020 3.33 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:08, 20 September 2020 3.31 (hist) [285 bytes] Algowikiadmin (talk | contribs) (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...")
- 18:08, 20 September 2020 3.29 (hist) [1,323 bytes] Algowikiadmin (talk | contribs) (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...")
- 18:06, 20 September 2020 3.27 (hist) [417 bytes] Algowikiadmin (talk | contribs) (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 ##...")
- 18:06, 20 September 2020 3.25 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:05, 20 September 2020 3.23 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:05, 20 September 2020 3.21 (hist) [657 bytes] Algowikiadmin (talk | contribs) (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...")
- 18:04, 20 September 2020 3.19 (hist) [444 bytes] Algowikiadmin (talk | contribs) (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...")
- 18:03, 20 September 2020 3.17 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:03, 20 September 2020 3.15 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:02, 20 September 2020 3.13 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 18:02, 20 September 2020 3.11 (hist) [205 bytes] Algowikiadmin (talk | contribs) (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...")
- 18:00, 20 September 2020 3.9 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 17:59, 20 September 2020 3.7 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 3")
- 17:59, 20 September 2020 3.5 (hist) [173 bytes] Algowikiadmin (talk | contribs) (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 3.3 (hist) [4,259 bytes] Algowikiadmin (talk | contribs) (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)) {...")
- 17:56, 20 September 2020 3.1 (hist) [3,596 bytes] Algowikiadmin (talk | contribs) (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;...")
- 22:09, 11 September 2020 11.35 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 22:07, 11 September 2020 11.33 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 22:06, 11 September 2020 11.31 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 22:06, 11 September 2020 11.29 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 22:06, 11 September 2020 11.27 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:23, 11 September 2020 11.25 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:22, 11 September 2020 11.23 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:21, 11 September 2020 11.21 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:18, 11 September 2020 11.13 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:18, 11 September 2020 11.19 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
- 19:18, 11 September 2020 11.17 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 11")
