| title | date | lastmod |
|---|---|---|
Annotations |
2022-11-07 |
2022-11-21 |
(03/07/2022, 13:24:26)
“Since this subarray must contain AŒmid�,thefor loop of lines 3–7 starts the index i at mid and works down to low, so that every subarray it considers is of the form AŒi : : mid�. Lines 1–2 initialize the variables left-sum, which holds the greatest sum found so far, and sum, holding the sum of the entries in AŒi : : mid�. Whenever we find, in line 5, a subarray AŒi : : mid� with a sum of values greater than left-sum, we update left-sum to this subarray’s sum in line 6, and in line 7 we update the variable max-left to record this index i. Lines 8–14 work analogously for the right half,” (“Introduction to algorithms”, 2009, p. 72) (pdf)
“For example, we can interpret a character string as an integer expressed in suitable radix notation. Thus, we might interpret the identifier pt as the pair of decimal integers .112; 116/,sincep D 112 and t D 116 in the ASCII character set; then, expressed as a radix-128 integer, pt becomes .112 128/ C 116 D 14452.” (“Introduction to algorithms”, 2009, p. 263) (pdf)
“11.3.3 Universal hashing” (“Introduction to algorithms”, 2009, p. 265) (pdf)
[image] (pdf)
(“Introduction to algorithms”, 2009, p. 929) gcd
“31.1-2 Prove that there are infinitely many primes. (Hint: Show that none of the primes p1;p2;:::;pk divide .p1p2 pk/ C 1.)” (“Introduction to algorithms”, 2009, p. 932) (pdf)